#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> v[50001], deg(50001), c(50001);

int main() {
    int n, m, ind = 0;
    fin >> n >> m;
    while (m--) {
        int node_1, node_2;
        fin >> node_1 >> node_2;
        v[node_1].push_back(node_2);
        deg[node_2]++;
    }
    for (int i = 1; i <= n; ++i) {
        if (deg[i] == 0) {
            c[ind++] = i;
        }
    }
    for (int i = 1; i <= n; ++i) {
        int nr = c[i - 1];
        for (int j = 0; j < v[nr].size(); ++j) {
            deg[v[nr][j]]--;
            if (deg[v[nr][j]] == 0) {
                c[ind++] = v[nr][j];
            }
        }
    }
    for (int i = 0; i < ind; ++i) {
        fout << c[i] << ' ';
    }
    return 0;
}