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

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
std::vector<std::vector<int>> adj;
std::vector<bool> visited;
std::vector<int> ans;
int n, m;

void visit(int nod) {
    visited[nod] = true;

    for (auto vecin : adj[nod]) {
        if (!visited[vecin])
            visit(vecin);
    }

    ans.push_back(nod);
}

void dfs() {
    for (int i = 1; i <= n; ++i) {
        if (!visited[i]) {
            visit(i);
        }
    }
}

int main() {
    fin >> n >> m;
    adj.resize(n+1);
    visited.resize(n+1);
    while (m--) {
        int x, y;
        fin >> x >> y;
        adj[x].push_back(y);
    }

    dfs();

    reverse(ans.begin(), ans.end());

    for (auto nod : ans) {
        fout << nod << ' ';
    }

    return 0;
}