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

using namespace std;

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

#define MAXN 50005

int n, m, grad[MAXN];
vector<int> G[MAXN];
queue<int> q;

void citire() {
    f >> n >> m;
    int nod1, nod2;
    for (int i = 0; i < m; ++i) {
        f >> nod1 >> nod2;
        if(find(G[nod1].begin(),G[nod1].end(),nod2)==G[nod1].end()) {
            grad[nod2]++;
            G[nod1].push_back(nod2);
        }
    }
}

void element_nou() {
    int nod = q.front();
    q.pop();
    g << nod << ' ';
    for (auto &nod2:G[nod]) {
        grad[nod2]--;
        if (!grad[nod2])
            q.push(nod2);
    }
}

void parcurgere() {
    for (int i = 1; i <= n; ++i)
        if (!grad[i])
            q.push(i);
    while (!q.empty())
        element_nou();
}

int main() {
    citire();
    parcurgere();
    return 0;
}