#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

#define vt vector
#define pb push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define all1(x) x.begin() + 1, x.end()
#define sz(x) (int)(x).size()

using namespace std;
using namespace __gnu_pbds;

using ll = long long;
using ld = long double;
using ull = unsigned long long;

template <class T> void re(vt <T>& x);
template <class T> void re(T& x) {
    cin >> x;
}

template <class H, class... T> void re(H &x, T&... y) {
    re(x); re(y...);
}

template <class T> void re(vt <T>& x) {
    for(auto& it : x)
        re(it);
}

template <class T> void wr(T x) {
    cout << x;
}

template <class H, class ...T> void wr(H x, T... y) {
    wr(x); wr(y...);
}

inline void Open(const string Name) {
    #ifndef ONLINE_JUDGE
        (void)!freopen((Name + ".in").c_str(), "r", stdin);
        (void)!freopen((Name + ".out").c_str(), "w", stdout);
    #endif
}

void solve() {
    int n, m; re(n, m);
    vt <vt <int>> adj(n + 1);
    vt <int> gi(n + 1);
    while(m--) {
        int a, b; cin >> a >> b;
        adj[a].emb(b);
        ++gi[b];
    }
 
    queue <int> q;
    vt <int> sol;
    for(int i = 1;i <= n;i++)
        if(gi[i] == 0) {
            q.em(i);
        }
 
    while(sz(q)) {
        int v = q.front();
        sol.emb(v);
        q.pop();
 
        for(int u : adj[v]) {
            if(--gi[u] == 0) {
                q.em(u);
            }
        }
    }
 
    for(auto& it : sol)
        wr(it, ' ');
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    Open("sortaret");

    int t = 1;
    for(;t;t--) {
        solve();
    }

    return 0;
}