#include <bits/stdc++.h>

using namespace std;

vector< vector<int> > nodes;
vector<bool> visited;
vector<int> solution;
void DFS(int i)
{
    visited[i] = true;
    for (int j = 0; j < nodes[i].size(); j++) {
        if (!visited[nodes[i][j]]) {
            DFS(nodes[i][j]);
        }
    }
    solution.push_back(i);
}

int main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);

    int n, m;
    cin >> n >> m;

    nodes.reserve(n);
    visited.reserve(n);
    for (int i = 0; i < n; i++) visited[i] = false;

    for (int i = 0, x, y; i < m; i++) {
        cin >> x >> y;
        nodes[x - 1].push_back(y - 1);
    }

    for (int i = 0; i < n; i++) {
        if (!visited[i]) {
            DFS(i);
        }
    }

    for (int i = solution.size() - 1; i >= 0; i--) {
        cout << solution[i] + 1 << " ";
    }
    cout << "\n";

    return 0;
}