#include <fstream>
#include <vector>
#include <algorithm>
using namespace std;

vector<int> a[50001];
vector<int> post_ordine;
int n;
int viz[50001];

void dfs(int x) {
    int i;
    viz[x] = 1;
    for (i = 0; i < a[x].size(); i++)
        if (!viz[a[x][i]])
            dfs(a[x][i]);
    post_ordine.push_back(x);
}

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

    ifstream f("sortaret.in");
    f >> n >> m;
    for (i = 1; i <= m; i++) {
        f >> x >> y;
        a[x].push_back(y);
    }
    f.close();

    for (i = 1; i <= n; i++)
        if (!viz[i])
            dfs(i);

    ofstream g("sortaret.out");
    for (i = post_ordine.size() - 1; i >= 0; i--)
        g << post_ordine[i] << ' ';
    g.close();

    return 0;
}