#include <bits/stdc++.h>

using namespace std;

vector<int> G[50005];
int in[50005];
bool viz[50005];

ofstream g("sortaret.out");

void dfs(int i) {
    g << i << " ";

    viz[i] = true;
    for(auto j: G[i]) {
        in[j] --;
        if(in[j] == 0)
            dfs(j);
    }
}

int main()
{
    ifstream f("sortaret.in");

    int n, m, x, y;
    f >> n >> m;

    for(int i = 1; i <= m; i ++) {
        f >> x >> y;
        G[x].push_back(y);
        in[y] ++;
    }

    for(int i = 1; i <= n; i ++) {
        if(in[i] == 0 && !viz[i])
            dfs(i);
    }
    g << "\n";
    return 0;
}