#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#define NR 100005
using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

vector <int>G[NR];
stack <int> varfuriSortate;

int viz[NR],m,n,nr,grad[NR];

void citire()
{
    f>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        f>>x>>y;
        G[x].push_back(y);
        grad[y]++;
    }
}
void sortareDFS(int varf)
{
    viz[varf]=1;
    vector <int>::iterator it;
    for(it=G[varf].begin(); it!=G[varf].end(); it++)
    {
        if(!viz[*it])
        {
            sortareDFS(*it);
        }
    }
    varfuriSortate.push(varf);
}


int main()
{
    citire();
    for(int i=1; i<=n; i++)
        if(!viz[i])
        {
            sortareDFS(i);
        }
    while(!varfuriSortate.empty())
    {
        g<<varfuriSortate.top();
        varfuriSortate.pop();
    }
    return 0;
}