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

#define ar array
#define vt vector
#define pq priority_queue
#define pu push
#define pub push_back
#define em emplace
#define emb emplace_back

#define all(x) x.begin(), x.end()
#define allr(x) x.rbegin(), x.rend()
#define allp(x, l, r) x.begin() + l, x.begin() + r
#define len(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, size_t N>
void re(array <T, N>& x);
template <class T> 
void re(vt <T>& x);

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

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

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

template <class T, size_t N>
void re(array <T, N>& x) {
    for(auto& it : x)
        re(it);
}

template <class T, size_t N>
void wr(array <T, N> x);
template <class T> 
void wr(vt <T> x);

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

template <class T, class ...M>  void wr(T x, M... args) {
    wr(x), wr(args...);
}

template <class T> 
void wr(vt <T> x) {
    for(auto it : x)
        wr(it, ' ');
}

template <class T, size_t N>
void wr(array <T, N> x) {
    for(auto it : x)
        wr(it, ' ');
}


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);
    vt <int> id(n);

    for (int i = 0; i < m; ++i) {
        int u, v; re(u, v);
        --u, --v;
        ++id[v];
        adj[u].emb(v);
    }

    /* First of all we determine the indegree for each vertex:

        * we put the vertices with indegree 0 in a queue.     

        * when we are traversing the queue, for the current first node in the queue we iterate trough each of
        it's neighboring vertices and we remove the edge between them.

        * if by doing this operation the indegree of a certain vertex becomes zero we append it to the back of the queue
        
        * we repeat this process till we have no more edges in the graph.

       It is important to mention that by deleating an edge between a and b we essentialy update the indegree value of b
       by -1 so we can do this operation really fast.
    */

    queue <int> q;
    for (int u = 0; u < n; ++u)
        if (id[u] == 0) 
            q.pu(u);

    vt <int> res;
    while (len(q)) {
        int u = q.front();
        q.pop();

        res.emb(u + 1);
        for (int v : adj[u])
            if (--id[v] == 0) {
                q.pu(v);
            }
    }

    wr(res);
}

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

    Open("sortaret");

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