#include <fstream>
#include <vector>
#include <queue>

using namespace std;

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

#define NMAX 50005

int n, m, grad_int[NMAX];
vector<int> G[NMAX];
queue<int> q;

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]) {
            g << nod << ' ';
            q.push(nod);
        }
    }
}

void sortare() {
    for (int i = 1; i <= n; ++i)
        if (!grad_int[i]) {
            g << i << ' ';
            q.push(i);
        }
    while (!q.empty()) {
        vizitare_nod(q.front());
        q.pop();
    }
}

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