#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector < int > A[100001];
stack < int > stiva;
int n, m, x, y;
bool vizitat[100001];

void dfs(int nod) {
    vizitat[nod] = true;

    for (int i = 1; i <= A[nod].size(); ++i)
        if (!vizitat[i]) {
            vizitat[i] = true;
            dfs(i);
        }

    stiva.push(nod);
}
int main() {
    fin >> n >> m;
    for (int i = 1; i <= m; i++) {
        fin >> x >> y;
        A[x].push_back(y);
    }

    for (int i = 1; i <= n; i++)
        if (!vizitat[i])
            dfs(i);

    while (!stiva.empty()) {
        fout << stiva.top() << " ";
        stiva.pop();
    }
}