#include <iostream>
#include <fstream>
#include <vector>
#include <stack>

using namespace std;

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

vector<int> a[50001];
stack<int> s;
int n, f[50001];

void dfs (int node) {
    f[node] = 1;
    for (auto i : a[node]) {
        if (!f[i]) dfs(i);
    }

    s.push(node);
}


int main() {
    int m, x, y;
    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 (!f[i]) {
            dfs(i);
        }
    }

    while (!s.empty()) {
        fout<<s.top()<<" ";

        s.pop();
    }

    return 0;
}