#include <fstream>
#include<bits/stdc++.h>
#include<algorithm>
#include<vector>
#include<stack>
#include<string>
#include<ctype.h>
#include<algorithm>
#define NMAX 50005
using namespace std;

vector<int> V[NMAX];
int postordine[NMAX];
bool ap[NMAX];
int n,m,nr;

ifstream fin("sortaret.in");
ofstream fout("sortaret.out");

void citire()
{
   fin>>n>>m;
   for(int i = 1; i <= m ; i++)
   {
      int x,y;
      fin>>x>>y;
      V[x].push_back(y);
   }

}

void DFS(int nod)
{
   ap[nod] = true;
   for(int i = 0 ;i<V[nod].size();i++)
      if(V[nod][i] == false)
         DFS(V[nod][i]);
   postordine[++nr] = nod ;


}

int main()
{

   citire();
   for(int i = 1;i<=n;i++)
   {
      if(ap[i]==false)
         DFS(i);
   }
   for(int i = 1;i<=nr;i++)
      cout<<postordine[i]<<" ";

}