#include <bits/stdc++.h>
using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n, m;
vector<int> adj[50004];
bitset<50004> viz;
vector<int> rez;
void dfs(int v)
{
    viz[v] = true;
    for (int u : adj[v])
    {
        if (!viz[u])
        {
            dfs(u);
        }
    }
    rez.push_back(v);
}
int main()
{
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int a, b;
        fin >> a >> b;
        adj[a].push_back(b);
    }
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }
    reverse(rez.begin(), rez.end());
    for (int i : rez)
    {
        fout << i << ' ';
    }
    fin.close();
    fout.close();
    return 0;
}