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

using namespace std;

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

const int MAXN = 100005;
vector<int> adj[MAXN];
bool vizitat[MAXN];
vector<int> solutie;

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

    for (int vecin : adj[nod]) {
        if (!vizitat[vecin]) {
            dfs(vecin);
        }
    }
    solutie.push_back(nod);
}

int main() {
    int n, m;
    fin >> n >> m;
    for (int i = 0; i < m; i++) {
        int u, v;
        fin >> u >> v;
        adj[u].push_back(v);
    }

    for (int i = 1; i <= n; i++) {
        if (!vizitat[i]) {
            dfs(i);
        }
    }
    for (int i = solutie.size() - 1; i >= 0; i--) {
        fout << solutie[i] << " ";
    }
    fout << "\n";
    return 0;
}