#include <bits/stdc++.h>

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