#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define F first
#define S second
#define endl '\n'
#define all(a) (a).begin(),(a).end()
using namespace std;
const int maxn = 50005;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void dfs(int v, const vector<vector<int>>& adj, vector<int>& vis, vector<int>& top) {
    vis[v] = 1;
    for (auto u : adj[v]) {
        if (!vis[u]) {
            dfs(u, adj, vis, top);
        }
    }
    top.pb(v);
}

void topological_sort(const vector<vector<int>>& adj, vector<int>& vis, vector<int>& top) {
    for (int i = 0; i < vis.size(); i++) {
        if (!vis[i]) {
            dfs(i, adj, vis, top);
        }
    }
    reverse(all(top));
}

void solve() {
    vector<vector<int>> adj(maxn, vector<int>());
    int n, m;
    fin >> n >> m;
    vector<int> vis(n, 0), top;
    while (m--) {
        int x, y;
        fin >> x >> y;
        x--;
        y--;
        adj[x].pb(y);
    }
    topological_sort(adj, vis, top);
    for (int i = 0; i < top.size(); i++) {
        fout << top[i] + 1 << " ";
    }
    fout << endl;
    return;
}
 
int main() {
    int t = 1;
    //fin >> t;
    while (t--) {
        solve();
    }
    return 0;
}