// https://goo.gl/fBmFxu
#include <bits/stdc++.h>
using namespace std;

#define NMAX        100009
#define MMAX        200009
#define kInf        (1 << 30)
#define kInfLL      (1LL << 60)
#define kMod        666013
#define edge pair<int, int>
#define x first
#define y second

#define USE_FILES "MLC"

#ifdef USE_FILES
#define cin fin
#define cout fout
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#endif

// number of tests from "in"
int test_cnt = 1;
void clean_test();

// your global variables are here
int n, m;
vector<int> G[NMAX];
bitset<NMAX> visited;
vector<int> topsort;

void dfs(int node) {
    visited[node] = 1;

    for (auto &x : G[node]) {
        if (!visited[x]) {
            dfs(x);
        }
    }

    topsort.push_back(node);
}
// your solution is here
void solve() {
    cin >> n >> m;

    for (int i = 1; i <= m; ++i) {
        int x, y;
        cin >> x >> y;

        G[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i) {
        if (!visited[i]) {
            dfs(i);
        }
    }

    reverse(topsort.begin(), topsort.end());
    for (auto &x : topsort) {
        cout << x << " ";
    }
    cout << "\n";

    if (test_cnt > 0) {
        clean_test();
    }
}


void clean_test() {
    // clean if needed
    visited.reset(); // reset all
    topsort.clear();

    for (int i = 1; i <= n; ++i) {
        if (G[i].size())  {
            G[i].clear();
        }
    }

    // clean every shit
    n = m  = 0;
}

int main() {
//     cin >> test_cnt;
    while (test_cnt--) {
        solve();
    }

    return 0;
}