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

ifstream cin("sortaret.in");
ofstream cout("sortaret.out");

vector <int> L[1000001];
int grad[1000001];

int main() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        grad[y]++;
        L[x].push_back(y);
    }
    queue <int> q;
    for (int i = 1; i <= n; i++) {
        if (grad[i] == 0) {
            q.push(i);
        }
    }

    while (!q.empty()) {
        int x = q.front();
        q.pop();
        cout << x << " ";
        for (auto y : L[x]) {
            grad[y]--;
            if (grad[y] == 0) {
                q.push(y);
            }
        }
    }
    return 0;
}