#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=5e4+10;
vector <int> a[N];
int nrpred[N],n,m;
queue <int> q;
int main()
{
    f>>n>>m;
    for(int i=1;i<=m;i++)
    {
        int x,y;
        f>>x>>y;
        a[x].push_back(y);
        nrpred[y]++;
    }
    for(int i=1;i<=n;i++)
    {
        if(nrpred[i]==0)
        {
            q.push(i);
        }
    }
    while(!q.empty())
    {
        int x=q.front();
        g<<x<<" ";
        q.pop();
        for(auto i:a[x])
        {
            nrpred[i]--;
            if(nrpred[i]==0)
            {
                q.push(i);
            }
        }
    }
    return 0;
}