#include <iostream>
#include <fstream>
#include <algorithm>
#include <vector>
#include <cmath>
#include <utility>
#define ll long long

using namespace std;

void dfs(int node, vector<bool> &vis, vector<vector<int>> &g, vector<int> &top_sort) {
    vis[node] = 1;
    for(auto it : g[node])
        if(!vis[it])
            dfs(it, vis, g, top_sort);
    top_sort.push_back(node);
}

int main() {

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

    int n, m;
    in >> n >> m;
    vector<vector<int>> g(n + 1);
    for(int i = 1; i <= m; i ++) {
        int x, y;
        in >> x >> y;
        g[x].push_back(y);
    }
    vector<bool> vis(n + 1, 0);
    vector<int> top_sort;
    for(int i = 1; i <= n; i ++)
        if(!vis[i])
            dfs(i, vis, g, top_sort);
    reverse(top_sort.begin(), top_sort.end());

    for(auto it : top_sort)
        out << it << " ";

    return 0;
}