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

using namespace std;
int viz[50005];
vector <int> coada;
vector <int> graft[50005];
int N;
void DFS(int nod)
{
    int i;
    viz[nod]=1;
    int lim=graft[nod].size();
    for(i=1;i<lim;i++)
        if(viz[i]==0)
            DFS(i);
    coada.push_back(nod);
}
int main()
{
    ifstream in("sortaret.in");
    ofstream out("sortaret.out");
    int M,i,x,y;
    in>>N>>M;
    for(i=1;i<=M;i++)
    {
        in>>x>>y;
        graft[y].push_back(x);
    }
    for(i=1;i<=N;i++)
        if(viz[i]==0)
            DFS(i);
    for(i=0;i<N;i++)
        out<<coada[i]<<" ";
    return 0;
}