#include <bits/stdc++.h>
 
using namespace std;
 
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
 
int n, m, x, y;
vector<int> v[50010], ans;
bitset<500010> viz;
 
void dfs(int node)
{
    viz[node] = 1;
    for (auto it : v[node])
        if (!viz[it])
            dfs(it);
    ans.push_back(node);
}
 
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        fin >> x >> y;
        v[x].push_back(y);
    }
    for(int i=1;i<=n;i++)
        if(!viz[i])
            dfs(i);
    
    for(vector<int> ::reverse_iterator it=ans.rbegin();it!=ans.rend();it++)
        fout<<(*it)<<" ";
    return 0;
}