#include <bits/stdc++.h>

using namespace std;
const int N=50010;
int n,m,x,y,gradinterior[N];
vector <int> v[N];
queue <int> q;
int main()
{
    cin>>n>>m;
    for(;m;m--)
    {
        cin>>x>>y;
        v[x].push_back(y);
        gradinterior[y]++;
    }
    for(int i=1;i<=n;i++)
        if(gradinterior[i]==0) q.push(i);
    while(q.size())
    {
        int nod=q.front();
        cout<<nod<<' ';
        q.pop();
        for(auto vec:v[nod])
        {
            gradinterior[vec]--;
            if(gradinterior[vec]==0)
                  q.push(vec);
        }

    }

    return 0;
}