#include <bits/stdc++.h>
#define NMAX 50003

using namespace std;

int n, m;
vector<vector<int> > g(50003);
vector<int> sol;
bool viz[NMAX];

void dfs(int nod) {
    viz[nod] = 1;
    for(int child : g[nod]) {
        if(!viz[child])
            dfs(child);
    }
    sol.push_back(nod);
}

int main()
{
    freopen("sortaret.in","r",stdin);
    freopen("sortaret.out","w",stdout);
    cin >> n >> m;
    for(int i = 1; i <= m; i++) {
        int x, y;
        cin >> x >> y;
        g[x].push_back(y);
    }
    for(int i = 1; i <= n; i++) {
        if(!viz[i])
            dfs(i);
    }
    reverse(sol.begin(),sol.end());
    for(int x:sol)
        cout << x << ' ';
    return 0;
}