#include <cstdio>
#define N 50002
#include <vector>
#include <deque>

using namespace std;
FILE *f,*g;

vector <int> graph[N];
bool viz[N];
int grad[N],coada[N],ps,pi;

void sortaret()
{
    int ps=1,nod;
    while(ps<=pi)
    {
        nod=coada[ps++];
        for(int i=0;i<graph[nod].size();++i)
            if(!viz[graph[nod][i]])
            {
                --grad[graph[nod][i]];
                if(!grad[graph[nod][i]])
                {
                    viz[graph[nod][i]]=1;
                    coada[++pi]=graph[nod][i];
                }
            }
    }
}
int main()
{
    f=fopen("sortaret.in","r");
    g=fopen("sortaret.out","w");
    int n,m;
    fscanf(f,"%d %d",&n,&m);
    int x,y;
    for(int i=1;i<=m;++i)
    {
        fscanf(f,"%d %d",&x,&y);
        graph[x].push_back(y);
        ++grad[y];
    }
    for(int i=1;i<=n;++i)
        if(!grad[i])
            viz[i]=1,coada[++pi]=i;
    sortaret();
    for(int i=1;i<=n;++i)
        fprintf(g,"%d ",coada[i]);
    fclose(f);
    fclose(g);
    return 0;
}