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

using namespace std;

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

vector <int> a[50005], ordine;

vector <bool> viz(50005, 0);

int n, m;

void dfs(int nod)
{
    viz[nod] = 1;

    for (auto vecin : a[nod]) {
        if (!viz[vecin]) {
            dfs(vecin);
        }
    }

    ordine.push_back(nod);
}

int main()
{
    f >> n >> m;

    for (int i = 1; i <= m; ++i) {
        int x, y;
        f >> x >> y;
        a[x].push_back(y);
    }

    for (int i = 1; i <= n; ++i) {
        if (!viz[i]) {
            dfs(i);
        }
    }

    reverse(ordine.begin(), ordine.end());

    for (auto it : ordine) {
        g << it << ' ';
    }

    return 0;
}