#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int i;
int grad[100005];
int x, n, m, y;
queue<int>q;
vector<int>a[100005];
int main()
{
    fin>>n>>m;
    for (i=1; i<=m; i++) {
        fin>>x>>y;
        a[x].push_back(y);
        grad[y]++;
    }
    for (i=1; i<=n; i++) {
        if (grad[i]==0) {
            q.push(i);
        }
    }
    while (q.empty()==0) {
        x=q.front();
        q.pop();
        fout<<x<<' ';
        for (int y:a[x]) {
            grad[y]--;
            if  (grad[y]==0) {
                q.push(y);
            }
        }
    }
    return 0;
}