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

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

int n, m;

vector<int> g[50005];
int dep[50005];

int main() {
    queue<int> nodep;

    in >> n >> m;

    for (int i = 0; i < m; ++i) {
        int a, b;
        in >> a >> b;
        g[a].push_back(b);
        dep[b]+= 1; }

    for (int i = 1; i <= n; ++i) if (dep[i] == 0) {
        nodep.push(i);
    }
    cout << "Hey baby \n";
    while (!nodep.empty()) {
        int u = nodep.front();
        nodep.pop();

        out << u << ' ';

        for (int j = 0; j < g[u].size(); ++j) {
            int v = g[u][j];
            dep[v]-= 1;
            if (!dep[v])
                nodep.push(v);
        }
    }

    return 0;
}