// sortare topologica

#include <iostream>
#include <fstream>
#include <vector>
#define NMAX 50005
using namespace std;
vector <int> v[NMAX],sol;
int n;
bool viz[NMAX];
void citire()
{
     int i,x,y,m;
     freopen("sortaret.in","r",stdin);
     scanf("%d%d",&n,&m);
     for(i=1;i<=m;i++)
     {
      scanf("%d%d",&x,&y);
      v[x].push_back(y);
     } 
}
void afisare()
{
     int i;
     freopen("sortaret.out","w",stdout);
     for(i=sol.size()-1;i>=0;i--)
      printf("%d ",sol[i]);
     printf("\n");
}
void dfs(int nod)
{
     int i;
     viz[nod]=1;
     for(i=0;i<v[nod].size();i++)
      if(viz[v[nod][i]]==0)
       dfs(v[nod][i]);
     sol.push_back(nod);
}
void sortare()
{
     int i;
     for(i=1;i<=n;i++)
      if(viz[i]==0)
       dfs(i);
}
int main()
{
    citire();
    sortare();
    afisare();
    return 0;
}