#include<fstream>
#include<cstdio>
#include<vector>
#include<queue>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,i,j,a,b,c,in[50005];
queue<int>q;
vector<int>v[50005];
vector<int>rez;
int main()
{
    ios::sync_with_stdio(false);
    fin.tie(0);
    fin>>n>>m;
    for(i=1;i<=m;++i)
    {
        fin>>a>>b;
        v[a].push_back(b);
        in[b]++;
    }
    for(i=1;i<=n;++i)
    {
        if(in[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        int x=q.front();
        q.pop();
        rez.push_back(x);
        for(auto y: v[x])
        {
            in[y]--;
            if(in[y]==0)
                q.push(y);
        }
    }
    for(auto y: rez)
        fout<<y<<" ";
    return 0;
}