#include <bits/stdc++.h>
#define inf 1000000003

using namespace std;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

vector<int> G[50005];
int viz[50005], TSORT[50005];
int n,m,k;

void dfs(int nod){
    viz[nod] = 1;
    for(auto vecin: G[nod]){
        if(!viz[vecin])
            dfs(vecin);
    }
    TSORT[++k] = nod;
}

int main(){
    int i,a,b;
    fin>>n>>m;
    for(i = 1; i <= m; i++){
        fin>>a>>b;
        G[a].push_back(b);
    }
    for(i = 1; i<= n; i++){
        if(!viz[i]){
            dfs(i);
        }
    }
    for(i = n; i >= 1; i--){
        fout<<TSORT[i]<<' ';
    }
    return 0;
}