#include <bits/stdc++.h>

using namespace std;

///SOL CU DFS

int n,m;
vector<int>graph[50005];
bool viz[50005];
vector<int>sortare;
void dfs(int nod)
{
    for(auto x:graph[nod])
    {
        if(!viz[x])
            dfs(x);
    }
    viz[nod]=1;
    sortare.push_back(nod);
}
int main()
{
    ifstream cin("sortaret.in");
    ofstream cout("sortaret.out");
    cin>>n>>m;
    for(int i=1; i<=m; i++)
    {
        int a,b;
        cin>>a>>b;
        graph[a].push_back(b);
    }
    for(int i=1; i<=n; i++)
        if(!viz[i])
            dfs(i);
            reverse(sortare.begin(), sortare.end());
    for(auto x: sortare)
        cout<<x<<" ";
    return 0;
}