#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
using namespace std;


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

    int n, m;
    fin >> n >> m;

    vector<vector<int>> adj(n+1);
    vector<int> befok(n+1, 0);

    for (int i = 0; i < m; i++) {
        int a,b;
        fin >> a >> b;
        adj[a].push_back(b);
        ++befok[b];
    }

    queue<int> nullasok;
    for (int i = 1; i <= n; i++)
        if (befok[i] == 0)
            nullasok.push(i);

    while (!nullasok.empty()) {
        int v = nullasok.front();
        fout << v << " ";
        nullasok.pop();

        for (int sz : adj[v]) {
            --befok[sz];
            if (befok[sz] == 0)
                nullasok.push(sz);
        }
    }

    fout << "\n";
    return 0;
}