//sortare topologica

#include <iostream>
#include <vector>
#include <fstream>
#include <bits/stdc++.h>

using namespace std;

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

priority_queue<int> C;
vector <int> L[10000001], sortare;
int d[100000001];

int main() {

    int n, m, x, y;
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        L[x].push_back(y);
        d[y] ++;
    }
    for (int i = 1; i <= n; i++) {
        if (d[i] == 0)
            C.push(i);
    }
    while (C.size() > 0) {
        int nod = C.top();
        C.pop();
        sortare.push_back(nod);
        for (auto m : L[nod]) {
            d[m] = d[m] - 1;
            if (d[m] == 0) {
                C.push(m);
            }
        }
    }
    for (int i = 0; i < sortare.size(); i++) {
        fout << sortare[i] << " ";
    }
    return 0;
}