#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
#include <queue>
#include <fstream>
using namespace std;

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

vector<vector<int>> neighbours(5e4 + 1);
map<int, int> levels;

void DFS(int node, bool visited[], int level) {
    visited[node] = true;
    for (int i = 0; i < neighbours[node].size(); ++i) {
        if (!visited[neighbours[node][i]]) {
            levels[neighbours[node][i]] = level;
            DFS(neighbours[node][i], visited, level + 1);
        }
    }
}

int main() {
    int n, m;
    fin >> n;
    vector<bool> roots(n + 1);
    for (fin >> m; m; m--) {
        int x, y;
        fin >> x >> y;
        neighbours[x].push_back(y);
        roots[y] = true;
    }
    for (int i = 1; i <= n; ++i) {
        if (!roots[i]) {
            bool visited[n + 1] = {false};
            levels[i] = 0;
            DFS(i, visited, 1);
        }
    }
    //sort(levels.begin(), levels.end());
    priority_queue<pair<int,int>> ans;
    for (int i = 1; i <= n; ++i) {
        ans.push({-levels[i], i});
    }
    while (!ans.empty()) {
        fout << ans.top().second << ' ';
        ans.pop();
    }

}