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

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

int main ()
{
    int n, m;
    in >> n >> m;
    int grad[n + 1];
    vector <int> arc[n + 1];

    for (int i = 1; i <= n; i ++) {
        grad[i] = 0;
    }

    while (m --) {
        int x, y;
        in >> x >> y;
        grad[y] ++;
        arc[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();
        out << x << " ";
        for (int i = 0; i < arc[x].size(); i ++) {
            grad[arc[x][i]] --;
            if (grad[arc[x][i]] == 0) {
                q.push(arc[x][i]);
            }
        }
    }

    return 0;
}