#include <bits/stdc++.h>

using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
const int N=100010;
vector<int> v[N];
int m,n,c,a,b,gr[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>a>>b;
        v[a].push_back(b);
        gr[b]++;
    }
    for(int i=1;i<=n;i++)
        if(gr[i]==0)
            q.push(i);
    while(q.size())
    {
        a=q.front();
        q.pop();
        g<<a<<' ';
        for(auto it:v[a])
        {
            gr[it]--;
            if(gr[it]==0)
                q.push(it);
        }
    }

    return 0;
}