#include <fstream>
#include <vector>
#include <queue>

using namespace std;

const int N = 50001;

vector<int> gr[N];
queue<int> q;
int nr[N];

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

    int n, m, x, y;
    in >> n >> m;
    while (m--) {
        in >> x >> y;
        gr[x].push_back(y);
        ++nr[y];
    }
    for (int i = 1; i <= n; ++i)
        if (!nr[i])
            q.push(i);
    int f;
    while (!q.empty()) {
        f = q.front();
        out << f << ' ';
        for (auto i : gr[f]) {
            if (nr[i]) {
                --nr[i];
                if (!nr[i])
                    q.push(i);
            }
        }
        q.pop();
    }

    in.close();
    out.close();
    return 0;
}