#include <bits/stdc++.h>

using namespace std;

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

int n, m, a, b;
vector <int> graf[50005], sol;
bool vizitat[50005];

void dfs(int nod) {
    vizitat[nod] = true;
    sol.push_back(nod);

    for (int j : graf[nod])
        if (!vizitat[j])
            dfs(j);
}

int main() {
    in >> n >> m;
    for (int i = 1; i <= m; ++i) {
        in >> a >> b;
        graf[a].push_back(b);
    }

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

    for (unsigned int i = 0; i < sol.size(); ++i)
        out << sol[i] << " ";
    return 0;
}