#include <fstream>
#include <vector>

using namespace std;

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

#define NMAX 50005

int n, m, grad_int[NMAX], q[NMAX], nrq, pozq = 1;
vector<int> G[NMAX];

void citire() {
    f >> n >> m;
    int x, y;
    for (int i = 1; i <= m; ++i) {
        f >> x >> y;
        G[x].push_back(y);
        grad_int[y]++;
    }
}

void vizitare_nod(int x) {
    for (auto &nod: G[x]) {
        grad_int[nod]--;
        if (!grad_int[nod])
            q[++nrq] = nod;
    }
}

void sortare() {
    for (int i = 1; i <= n; ++i)
        if (!grad_int[i])
            q[++nrq] = i;
    while (pozq <= nrq)
        vizitare_nod(q[pozq++]);
}

void afisare() {
    for (int i = 1; i <= n; ++i)
        g << q[i] << ' ';
}

int main() {
    citire();
    sortare();
    afisare();
    return 0;
}