#include <iostream>
#include <fstream>
#include <queue>
#include <vector>
#include <stack>
using namespace std;
///DFS aproach for topological sort
ifstream fi("sortaret.in");
ofstream fo("sortaret.out");
int N,M;
vector <int>V[50005];
stack <int>lista;
int viz[50005];
void DFS(int x)
{
    viz[x]=1;
    for(int i=0;i<V[x].size();i++)
    {
        int vecin=V[x][i];
        if(!viz[vecin])
            DFS(vecin);
    }
    lista.push(x);
}
int main()
{
    fi>>N>>M;
    for(int i=1;i<=M;i++)
    {
        int x,y;
        fi>>x>>y;
        V[x].push_back(y);
    }
    for(int i=1;i<=N;i++)
        if(!viz[i])
            DFS(i);
    while(!lista.empty())
    {
        int numar=lista.top();
        fo<<numar<<" ";
        lista.pop();
    }
    return 0;
}