#include <iostream>
#include <fstream>
#include <bitset>
#include <algorithm>
#include <vector>
#include <set>
#include <queue>

using namespace std;

int n, m, grad[50001];
priority_queue <int, vector<int>, greater <int> > q;
vector <int> g[50001];
ifstream fin ("sortaret.in");
ofstream fout("sortaret.out");

int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++){
        int x, y;
        fin >> x >> y;
        grad[y]++;
        g[x].push_back(y);
    }
    for (int i = 1; i <= n; i++)
        if (grad[i] == 0)
            q.push(i);
    while (!q.empty()){
        int curr = q.top();
        q.pop();
        for (int i = 0; i < g[curr].size(); i++){
            grad[g[curr][i]]--;
            if (grad[g[curr][i]] == 0)
                q.push(g[curr][i]);
        }
        fout << curr << ' ';
    }
    return 0;
}

// asta este solutia minima lexicografica