#include <fstream>
#include <queue>
#include <vector>
#include <stack>
#include <algorithm>
using namespace std;
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int n,m,d[50005],sol[50005],k,viz[50005];
vector<int>l[50005];
queue<int>q;
int main()
{
    cin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        cin>>x>>y;
        l[x].push_back(y);
        d[y]++;
    }
    for(int i=1;i<=n;i++)
        if(d[i]==0)
            q.push(i);
    while(!q.empty())
    {
        int nod=q.front();
        cout<<nod<<" ";
        for(int i=0;i<l[nod].size();i++)
        {
            int vecin=l[nod][i];
            d[vecin]--;
            if(d[vecin]==0)
                q.push(vecin);
        }
        q.pop();
    }
    return 0;
}