#include <bits/stdc++.h>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
#define NMAX 50005
int n, m, x, y, nr, viz[NMAX], v[NMAX];
vector<int> G[NMAX];
void dfs(int nod)
{
    viz[nod] = 1;
    for (auto vecin : G[nod]){
        if (!viz[vecin]){
            dfs(vecin);
        }
    }
    v[++nr] = nod;
}
int main() {
    fin >> n >> m;
    for (int i=1;i<=m;i++){
        fin >> x >> y;
        G[x].push_back(y);
    }
    nr = 0;
    for (int i=1;i<=n;i++){
        if (!viz[i]){
            dfs(i);
        }
    }

    for (int i=n;i>=1;i--){
        fout << v[i] << ' ';
    }
    fout << '\n';
    return 0;
}