#include<fstream>
#include<vector>
using namespace std;
int n, m, i, x, y, k;
int sol[50003], f[50003], viz[50003];
vector<int> v[50003];
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void dfs(int nod){
    viz[nod] = 1;
    for(int i = 0; i < v[nod].size(); i++){
        int vecin = v[nod][i];
        if(viz[vecin] == 0){
            dfs(vecin);
        }
    }
    sol[++k] = nod;
}
int main(){
    fin>> n >> m;
    for(i = 1; i <= m; i++){
        fin>> x >> y;
        v[x].push_back(y);
        f[y]++;
    }
    for(i = 1; i <= n; i++){
        if(f[i] == 0){
            dfs(i);
        }
    }
    for(i = n; i >= 1; i--){
        fout<< sol[i] <<" ";
    }
    return 0;
}