#include <fstream>
#include <vector>
#include <queue>

const int NMAX=50001;
std::queue<int>q;
std::vector<int>succ[NMAX];
std::vector<int>sol;
int pred[NMAX];
bool viz[NMAX];
std::ifstream in("sortaret.in");
std::ofstream out("sortaret.out");

void dfs(int nod){
    viz[nod]=1;
    for(int x:succ[nod])
        if(!viz[x])
            dfs(x);
    sol.push_back(nod);
}

int main(){
    int n,m;
    in>>n>>m;
    for(int i=1,x,y;i<=m;i++)
        in>>x>>y,succ[x].push_back(y),pred[y]++;
    for(int i=1;i<=n;i++)
        if(!viz[i] && pred[i]==0)
            dfs(i);
    for(int i=sol.size()-1;i>=0;i--)
        out<<sol[i]<<" ";
    return 0;
}