#include <bits/stdc++.h>
#define N_MAX 50005
using namespace std;
ifstream in("sortaret.in");
ofstream out("sortaret.out");
vector <int> lista[N_MAX];
vector <int> solve;
int n,m,COL[N_MAX];
void TOP_SORT(int node)
{
    for(int i=0; i<lista[node].size(); i++)
    {
        if(COL[lista[node][i]]==0)
            TOP_SORT(lista[node][i]);
    }
    COL[node]=1;
    solve.push_back(node);
}
int main()
{
    in >> n >> m;
    for(int i=1; i<=m; i++)
    {
        int x,y;
        in >> x >> y;
        lista[x].push_back(y);
    }
    for(int i=1; i<=n; i++)
    {
        if(!COL[i])
            TOP_SORT(i);
    }
    for(int i=solve.size()-1; i>=0; i--)
    {
        out << solve[i] << ' ';
    }
}