#include <bits/stdc++.h>
#define ll long long
using namespace std;

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

bitset <50001> reached;
vector <int> parents[50001];

void reverseDfs(int current) {
    reached[current] = 1;
    for (int i = 0; i < parents[current].size(); i++)
        if (!reached[parents[current][i]])
            reverseDfs(parents[current][i]);

    fout << current << " ";
}

int main() {
    int n, m, x, y;

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

    for (int i = 1; i <= n; i++)
        if (!reached[i])
            reverseDfs(i);

    return 0;
}