#include<bits/stdc++.h>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,i,a,b;
vector<int>graf[50001];
int gr[50001];
int main()
{
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        graf[a].push_back(b);
        gr[b]++;
    }
    queue<int>q;
    for(i=1;i<=n;i++)
    {
        if(gr[i]==0)
        {
            q.push(i);
        }
    }

    while(!q.empty())
    {
        a=q.front();
        q.pop();
        g<<a<<" ";
        for(i=0;i<graf[a].size();i++)
        {
            gr[graf[a][i]]--;
            if(gr[graf[a][i]]==0)
                q.push(graf[a][i]);
        }
    }
    return 0;
}