#include <bits/stdc++.h>
using namespace std;

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

int n, m, in[50005];
vector <int> v[50005], ans;
queue <int> q;

void sortare_t() {
    while (!q.empty()) {
        int nod = q.front();
        q.pop();
        for (int i : v[nod]) {
            in[i]--;
            if (in[i] == 0) {
                q.push(i);
                ans.push_back(i);
            }
        }
    }
}

int main()
{
    fin >> n >> m;
    for (int k = 1; k <= m; ++k) {
        int i, j;
        fin >> i >> j;
        v[i].push_back(j);
        ++in[j];
    }

    for (int i = 1; i <= n; ++i) {
        if (!in[i]) {
            q.push(i);
            ans.push_back(i);
        }
    }

    sortare_t();
    for (int i : ans) fout << i << ' ';
    return 0;
}