#include <bits/stdc++.h>

using namespace std;

const int maxn = 5e4 + 5;

vector <int> v[maxn];
vector <int> sol;
bool viz[maxn];

void dfs(int nod)  {
    if(viz[nod] == 1)
        return;
    viz[nod] = 1;
    for(auto x : v[nod])  {
        dfs(x);
    }
    sol.push_back(nod);
}

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