#include <bits/stdc++.h>
#include <vector>

using namespace std;
ifstream f("sortatrt.in");
ofstream g("sortatrt.out");
const int N=50010;
vector<int> v[N];
int n,m,x,y,gr[N];
queue<int> q;
int main()
{
    f>>n>>m;
    for(;m;m--)
    {
        f>>x>>y;
        v[x].push_back(y);
        gr[y]++;
    }
    for(int i=1;i<=n;i++)
    if(!gr[i])
        q.push(i);
    while(q.size())
    {
        x=q.front();
        g<<x<<' ';
        q.pop();

        for(auto it:v[x])
        {
            gr[it]--;
            if(!gr[it])q.push(it);
        }


    }
    return 0;
}