#include <bits/stdc++.h>

using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
queue <int>q;
vector <int>L[50005];
int viz[50005],grad[50005],n,m;
void Citire()
{
    int x,y;
    fin>>n>>m;
    for(int i=1;i<=m;i++)
    {
        fin>>x>>y;
        L[x].push_back(y);
        grad[y]++;
    }
}
void Rez()
{
    int el;
    for(int i=1;i<=n;i++)
    {
        if(grad[i]==0)
            q.push(i);
    }
    while(!q.empty())
    {
        el=q.front();
        viz[el]=1;
        q.pop();
        fout<<el<<" ";
        for(int i=0;i<L[el].size();i++)
        {
            if((--grad[L[el][i]])==0 && !viz[L[el][i]])
                q.push(L[el][i]);
        }
    }
}
int main()
{
    Citire();
    Rez();
    return 0;
}