#include <bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,x,y,grad[50011],k;
queue <int> q;
vector <int> v[50011];
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>x>>y;
        v[x].push_back(y);
        grad[y]++;
    }
    for(i=1;i<=n;i++)
        if(!grad[i])
            q.push(i);
    while(!q.empty())
    {
        k=q.front();
        q.pop();
        g<<k<<" ";
        for(int i=0;i<v[k].size();i++)
        {
            grad[v[k][i]]--;
            if(grad[v[k][i]]==0)
                q.push(v[k][i]);
        }
    }
    return 0;
}