#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

const int NMAX = 50005;

int n,m,x,y;
int grad[NMAX];
vector <int> v[NMAX];
queue <int> q;

int main()
{
    fin >> n >> m;
    for(int i=1;i<=m;i++){
        fin >> x >> y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(int i=1;i<=n;i++){
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty()){
        int nod = q.front();
        fout << nod << ' ';
        q.pop();
        for(int i=0;i<v[nod].size();i++){
            int vecin = v[nod][i];
            grad[vecin]--;
            if(grad[vecin] == 0)
                q.push(vecin);
        }
    }
    return 0;
}