#include <fstream>
#include <vector>
using namespace std;
vector<int> L[50010];
int n,m,i,k,x,y,v[50010],C[50010],verif[50010];
void dfs_st(int crt){
    v[crt]=1;
    for (int i=0;i<L[crt].size();i++){
        int vecin=L[crt][i];
        if (v[vecin]==0){
            dfs_st(vecin);
        }
    }
    C[++k]=crt;
}
int main (){
    ifstream fin ("sortaret.in");
    ofstream fout ("sortaret.out");
    fin>>n>>m;
    while (fin>>x>>y){
        L[x].push_back(y);
        verif[y]++;
    }
    for (i=1;i<=n;i++){
        if (verif[i]==0){
            dfs_st(i);
        }
    }
    for (i=n;i>=1;i--){
        fout<<C[i]<<" ";
    }
    return 0;
}