#include <fstream>
#include <iostream>
#include <vector>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");


#define MAX 3010;

int  viz[50000];
vector<int> G[50000];
int dr;
int st[50000];

int m , n , x , y , nod;

void dfs (int nod)
{
    viz[nod] = 1;
    for(auto it:G[nod])
        if(!viz[it]) dfs[it];
    dr++;
    st[dr] = nod;
}

int main()
{
    fin >> n >> m;
    while(m--){
        fin >> x >> y;
        G[x].push_back(y);
    }
    for(int i = 1 ; i <= n ; i++)
        if(!viz[i]) dfs[i];

    for(int i = n ; i >= 1 ; --i)
        fout << st[i] << " ";

    return 0;
}