#include <bits/stdc++.h>

using namespace std;

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

int n, m, x, y;
vector<int> a[50001];
bool viz[50001];

void sorttop(int i) {
    sort(a[i].begin(), a[i].end());

    for (int x : a[i]) {
        if (!viz[x]) {
            fout << x << " ";
        }
    }
    for (int x : a[i]) {
        if (!viz[x]) {
            sorttop(x);
            viz[x] = 1;
        }
    }
}

int main() {
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        fin >> x >> y;
        a[x].push_back(y);
    }

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