#include <fstream>
#include <iostream>
#include <vector>
using namespace std;
ifstream fin("sortaret.in");
ofstream fout("sortaret.out");
int k=0,n,m,i,x,y;
vector <int> L[50002],sol;
bool fr[50002];
int nr[50002];
void dfs(int nod){
fr[nod]=1;

for(int i=0;i<L[nod].size();i++){
      int vecin=L[nod][i];
      if(fr[vecin]==0)
            dfs(vecin);
}
cout<<nod<<" ";
sol.push_back(nod);
}
int main()
{
   fin>>n>>m;
   for(i=1;i<=m;i++)
   {
         fin>>x>>y;
         L[x].push_back(y);
            nr[y]++;
   }
   for(i=1;i<=n;i++)
   {
         if(fr[i]==0&&nr[i]==0)
            dfs(i);
   }
   for(i=sol.size()-1;i>=0;i--)
      fout<<sol[i]<<" ";
}