#include <bits/stdc++.h>

using namespace std;

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

const int max_n = (int)5e4 + 5;

vector<int> g[max_n];

vector<bool> visited(max_n);

vector<int> ans;

void dfs(int u){
    visited[u] = true;
    for(int v : g[u]) {
        if(!visited[v]) {
            dfs(v);
        }
    }
    ans.push_back(u);
}

int main()
{
    int n, m; fin >> n >> m;
    for(int i = 0; i < m; ++i){
        int u, v; fin >> u >> v;
        g[u].push_back(v);
    }
    for(int i = 1; i <= n; ++i){
        if (!visited[i]){
            dfs(i);
        }
    }
    reverse(ans.begin(), ans.end());
    for(int v : ans){
        fout << v << " ";
    }
    return 0;
}