#include <bits/stdc++.h>

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
vector<int> a[50002];
int n, m, i, x, y;
queue<int> q;
int gi[t50002];

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

    for(i = 1; i <= n; i++) {
        if(gi[i] == 0) q.push(i);
    }

    while(!q.empty()) {
        int nod = q.front();
        q.pop();

        fout << nod << " ";

        for(auto it : a[nod]) {
            gi[it]--;
            if(gi[it] == 0) q.push(it);
        }
    }

    return 0;
}