#include <bits/stdc++.h>
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n,m;
vector < int > v[50005];
int x,y;
int gradint[50005];
queue < int > q;

int main()
{
    f >> n >> m;
    for (int i=1;i<=m;i++) {
        f >> x >> y;
        v[x].push_back(y);
        gradint[y]++;
    }
    for (int i=1;i<=n;i++) {
        if (gradint[i]==0) {
            q.push(i);
        }
    }
    while (q.empty()==0) {
        int nod = q.front();
        g << nod << " ";
        q.pop();
        for (int i=0;i<v[nod].size();i++) {
            int nodtoviz = v[nod][i];
            gradint[nodtoviz]--;
            if (gradint[nodtoviz]==0) {
                q.push(nodtoviz);
            }
        }
    }
    return 0;
}