#include <iostream>
#include <fstream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
const int nmax=100000;
vector <int> g[nmax+5];
bool use[nmax+5];
int sol[nmax+5];
int n,m,k;
void read(){
    fin>>n>>m;
    for(int i=1;i<=m;++i){
        int x,y;
        fin>>x>>y;
        g[x].push_back(y);
    }
}
void dfs(int nod){
    use[nod]=1;
    for(auto vecin:g[nod]){
        if(!use[vecin])
            dfs(vecin);
    }
    sol[++k]=nod;
}
int main()
{
    read();
    for(int i=1;i<=n;++i){
        if(!use[i])
            dfs(i);
    }
    for(int i=n;i>=1;--i)
        fout<<sol[i]<<" ";
    return 0;
}