#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

ifstream F("sortaret.in");
ofstream G("sortaret.out");

const int N = 50010;

int n,m,mk[N];
vector<int> v[N],stack;

void df(int x)
{
    mk[x] = 1;
    for (int i=0;i<int(v[x].size());++i)
        if ( mk[ v[x][i] ] == 0 )
            df(v[x][i]);
    stack.push_back( x );
    cout<<x<<endl;
}

int main()
{
    F>>n>>m;
    for (int i=1,x,y;i<=m;++i)
    {
        F>>x>>y;
        v[x].push_back(y);
    }
    for (int i=1;i<=n;++i)
        if ( mk[i] == 0 )
            df(i);
    for (;!stack.empty();stack.pop_back())
        G<<stack.back()<<' ';
    G<<'\n';
}