#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e4, maxm = 1e5;

int n, m;
vector <int> v[maxn + 1];
bool viz[maxn + 1];
vector <int> sol;

void dfs(int nod)  {
    if(viz[nod])
        return;
    viz[nod] = 1;
    for(auto &x : v[nod])  {
        dfs(x);
    }
    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;
        v[x].push_back(y);
    }
    for(int i = 1;i <= n;i++)
        dfs(i);
    for(int i = sol.size() - 1;i >= 0;i--)
        cout << sol[i] << " ";
    return 0;
}