#include <bits/stdc++.h>
#define DIM 50010
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int n,m,i,x,y,k,sol[DIM],f[DIM];
vector<int> L[DIM];
void dfs(int nod) {
    f[nod]=1;
    for (auto vecin:L[nod]) {
        if (f[vecin]==0)
            dfs(vecin);
    }
    sol[k++]=nod;
}
int main() {
    fin>>n>>m;
    for (i=1;i<=m;i++) {
        fin>>x>>y;
        L[x].push_back(y);
    }
    for (i=1;i<=n;i++)
        if (f[i]==0)
            dfs(i);
    while (k--)
        fout<<sol[k]<<" ";
    return 0;
}