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

using namespace std;

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