#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],viz[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_and_write(void)
{
    int i,j,k;
    for(i=1;i<=n;i++)
        for(j=1;j<=n;j++)
            if(!viz[j] && deg[j]==0)
            {
                viz[j]=1;
                g<<j<<" ";
                for(k=0;k<G[j].size();k++)
                    deg[G[j][k]]--;
                break;
            }
}
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]++;
    }
}
int main(void)
{
    read_data();
    solve_and_write();
    f.close();
    g.close();
    return 0;
}