#include<fstream>
#include<iostream>
#include<string.h>
#include<vector>
using namespace std;
ifstream f("sortaret.in");
ofstream g("sortaret.out");
int n,m,deg[50100],Q[50100];
vector<int> G[50100];
///deg[x] = gradul exterior al nodului x
///folosesc o coada Q in care introduc pe rand nodurile care
///au gradul exterior zero
///complexitate O(N+M)
void solve(void)
{
    int i,x;
    vector<int>::iterator it;
    for(x=1;x<=n;x++)
        if(deg[x] == 0)
            Q[Q[0]++]=x;
    for(i=1;i<=n;i++)
    {
        x=Q[i];
        for(it=G[x].begin();it!=G[x].end();it++)
        {
            deg[*it]--;
            if(deg[*it]==0)
                Q[Q[0]++]=*it;
        }
    }
}
void read_data(void)
{
    int i,a,b;
    f>>n>>m;
    for(i=1;i<=m;i++)
    {
        f>>a>>b;
        G[a].push_back(b);
        deg[b]++;
    }
}
void write_data(void)
{
    int i;
    for(i=1;i<=n;i++)
        g<<Q[i];
}
int main(void)
{
    read_data();
    solve();
    write_data();
    f.close();
    g.close();
    return 0;
}