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

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

const int N_MAX = 50000;

int n, m;
vector<int> gr[N_MAX + 2];

int st, dr;
int ans[N_MAX + 2], vis[N_MAX + 2];

void dfs(int node) {
    for(auto it: gr[node]) {
        vis[it]--;

        if(!vis[it]) {
            ans[++dr] = it;
            dfs(it);
        }
    }
}

int main() {
    in >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        in >> x >> y;

        vis[y]++;
        gr[x].push_back(y);
    }

    st = 1;
    for(int i = 1; i <= n; i++)
        if(!vis[i])
            ans[++dr] = i;

    while(st <= dr)
        dfs(ans[st++]);

    for(int i = 1; i <= n; i++)
        out << ans[i] << ' ';

    return 0;
}