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

using namespace std;

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

vector<int> graph[50002];
vector<bool> visited;
vector<int> sorted;

void dfs(int start) {
    visited[start] = true;
    for (auto node : graph[start]) {
        if(!visited[node]) {
            dfs(node);
        }
    }
    sorted.push_back(start);
}

int main() {
    int n, m;
    fin >> n >> m;

    visited.resize(n + 1);

    for(int i = 1; i <= m; i++) {
        int x, y;
        fin >> x >> y;

        graph[x].push_back(y);
    }

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

    for(int i = sorted.size() - 1; i >= 0; i--) {
        fout << sorted[i] << " ";
    }
}