#include <bits/stdc++.h>

#define nlim 50005

using namespace std;

ifstream f("sortaret.in");
ofstream g("sortaret.out");

int n, m;
bool viz[nlim], gr[nlim];
vector<int> v[nlim], nodes;

void DFS(int nod) {
    viz[nod] = 1;
    for (auto it : v[nod])
        if (!viz[it])
            DFS(it);
    nodes.push_back(nod);
}

int main()
{
    f >> n >> m;
    for (int i = 1; i <= m; ++i) {
        int x, y;
        f >> x >> y;
        v[x].push_back(y);
        gr[y] = 1;
    }
    for (int i = 1; i <= n; ++i)
        if (!gr[i]) DFS(i);
    reverse(nodes.begin(), nodes.end());
    for (auto it : nodes)
        g << it << " ";
}