#include <fstream>
#include <vector>
#include <stack>
using namespace std;
vector<int>G[50005];
bool viz[50005];
stack<int>topsort;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
void dfs(int u){
   int v;viz[u]=1;
   for(int i=0;i<G[u].size();i++){
    v=G[u][i];
    if(viz[v]==0){dfs(v);}
   }
   topsort.push(u);
}
int main()
{
    int n,m,i,u,v;fin>>n>>m;
    for(i=1;i<=m;i++){
        fin>>u>>v;
        G[u].push_back(v);
    }
    for(i=1;i<=n;i++){
        if(viz[i]==0){dfs(i);}
    }
    while(!topsort.empty()){
        fout<<topsort.top()<<" ";
        topsort.pop();
    }
    fout<<'\n';
    return 0;
}