#include <iostream>
#include <fstream>
#include <vector>

using namespace std;

vector <int> graf[50005];
vector <int> graft[50005];
int viz[50005];
vector <int> coada;
int grad[50005];
void Sortare_Topologica(int N)
{
    int i,j,x,lim;
    for(i=1;i<=N;i++)
        if(grad[i]==0)
        coada.push_back(i);
    j=-1;
    while(j!=N-1)
    {
        j++;
        x=coada[j];
        lim=graf[x].size();
        for(i=0;i<lim;i++)
        {
            grad[graf[x][i]]--;
            if(grad[graf[x][i]]==0)
                coada.push_back(graf[x][i]);
        }
    }
}
int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int N,M,x,y,i;
    in>>N>>M;
    for(i=1;i<=M;i++)
    {
        in>>x>>y;
        graf[x].push_back(y);
        graft[y].push_back(x);
        grad[y]++;
    }
    Sortare_Topologica(N);
    for(i=0;i<N;i++)
        out<<coada[i]<<" ";
    return 0;
}