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

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

int main() {
    int n, m;
    fin >> n >> m;
    
    vector<int> liste_adiacenta[n + 1];
    vector<int> grad_interior_nod(n + 1, 0);
    for(int i = 0; i < m; i++) {
        int x, y;
        fin >> x >> y;
        liste_adiacenta[x].push_back(y);
        grad_interior_nod[y]++;
    }

    queue<int> noduri_grad_0; 
    for(int i = 1; i <= n; i++) {
        if(grad_interior_nod[i] == 0) {
            noduri_grad_0.push(i);
        }
    }
    vector<int> vector_sortat;

    while(!noduri_grad_0.empty()) {
        int node = noduri_grad_0.front();
        noduri_grad_0.pop();
        vector_sortat.push_back(node);
        for(auto it : liste_adiacenta[node]) {
            grad_interior_nod[it]--;
            if(grad_interior_nod[it] == 0) {
                noduri_grad_0.push(it);
            }
        }
    }
    for(auto element : vector_sortat) {
        fout << element << " ";
    }
    fout << "\n";
    return 0;
}