#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

const int Nmax = 50000;
vector <int> adj[Nmax + 1];
vector <int> ans;
bool viz[Nmax + 1];

void dfs(int node)
{
    viz[node] = true;
    for (auto u : adj[node])
    {
        if (!viz[u])
        {
            dfs(u);
        }
    }
    ans.push_back(node);
}

void topological_sort(int n)
{
    for (int i = 1; i <= n; i++)
    {
        if (!viz[i])
        {
            dfs(i);
        }
    }
    reverse(ans.begin(), ans.end());
}

int main()
{
    ifstream fin("sortaret.in");
    ofstream fout("sortaret.out");
    int n, m;
    fin >> n >> m;
    for (int i = 1; i <= m; i++)
    {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }
    topological_sort(n);
    for (int i = 0; i < ans.size(); i++)
    {
        fout << ans[i] << " ";
    }
    return 0;
}