#include <bits/stdc++.h>

using namespace std;

void dfs(
    int k, vector<vector<int>>& adj, 
    vector<bool>& visited, stack<int>& topological_order
) {
    visited[k] = true;
    for (int i : adj[k]) {
        if (!visited[i]) {
            dfs(i, adj, visited, topological_order);
        }
    }
    topological_order.push(k);
}

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

    int N; fin >> N;
    int M; fin >> M;
    vector<vector<int>> adj(N + 1, vector<int>());
    for (int i = 1; i <= M; ++i) {
        int x; fin >> x;
        int y; fin >> y;
        adj[x].push_back(y);
    }

    stack<int> topological_order;
    vector<bool> visited(N + 1);
    for (int i = 1; i <= N; ++i) {
        if (!visited[i]) {
            dfs(i, adj, visited, topological_order);
        }
    }

    while (topological_order.size()) {
        fout << topological_order.top() << ' ';
        topological_order.pop();
    }

    return 0;
}