#include "bits/stdc++.h"
using namespace std;
 
#define ll long long
 
#define       forn(i,n)              for(int i=0;i<n;i++)
#define          all(v)              v.begin(), v.end()
#define         rall(v)              v.rbegin(),v.rend()
 
#define            pb                push_back
#define          sz(a)               (int)a.size()

const int N = 5e5 + 10;
vector<int> order, adj[N];
bool vis[N];
void dfs(int u) {
    vis[u] = true;
    for(int v: adj[u]) {
        if(!vis[v]) dfs(v);
    }
    order.pb(u);
}

void solve() {
    int n, m;
    cin >> n >> m;
    for(int i = 0;i < m; ++i) {
        int a, b;
        cin >> a >> b;
        adj[a].pb(b);
    }    
    for(int i = 1;i <= n; ++i) {
        if(!vis[i]) dfs(i);
    }
    reverse(all(order));
    for(int x: order) cout << x << " ";
    cout << "\n";
} 
 
int32_t main() {
    freopen("sortaret.in", "r", stdin);
    freopen("sortaret.out", "w", stdout);
    ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
    int t = 1;
    //cin >> t;
    while(t--) {
        solve();
    }
}