#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=50002;
int n,m,gi[N];
vector<int> v[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        int i,j;
        f>>i>>j;
        v[i].push_back(j);
        gi[j]++;
    }
    int p=1,u=0;
    for(int i=1;i<=n;i++)
        if(gi[i]==0)
            q.push(i);
    while(q.size())
    {
        int nod=q.front();
        q.pop();
        g<<nod<<' ';
        for(auto vec:v[nod])
        {
            gi[vec]--;
            if(gi[vec]==0)
                q.push(vec);
        }
    }
    return 0;
}