#include <bits/stdc++.h>
using namespace std;

int n, m;
vector <int> v[50010], sol;
bool u[50010];

void dfs(int q){
    u[q] = 1;
    for (auto it: v[q])
        if (!u[it]) dfs(it);
    sol.push_back(q);
}

int main(){
    ifstream cin ("sortaret.in");
    ofstream cout ("sortaret.out");
    cin >> n >> m;
    for (int i=1, x, y; i<=m; i++){
        cin >> x >> y;
        v[x].push_back(y);
    }
    for (int i=1; i<=n; i++)
        if (!u[i]) dfs(i);
    for (int i=n-1; i>=0; i--) cout << sol[i] << " ";
    return 0;
}