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

using namespace std;

vector <int> v[50005];
int viz[50005],sol[50005],pos=0;

void dfs(int node)
{
    viz[node]=1;
    for(auto it : v[node]){
        if(viz[it]==0){
            dfs(it);
        }
    }
    sol[++pos]=node;
}
ifstream cin("sortaret.in");
ofstream cout("sortaret.out");
int main()
{
    int n,m,a,b;
    cin>>n>>m;
    for(int i=0;i<m;i++){
        cin>>a>>b;
        v[a].push_back(b);
    }
    for(int i=1;i<=n;i++)
        if(viz[i]==0)
            dfs(i);
    for(int i=pos;i>=1;i--)
        cout<<sol[i]<<" ";
    return 0;
}