#include <cstdlib>
#include <iostream>
#include <fstream>
#include <deque>
#include <vector>

using namespace std;
 int viz[50001];
 vector <int> solutie;
 int n,m,x,y;
 vector <int>lista[50001];
 
void sortaret(int nod){
    int i;
    viz[nod]  = 1;
    for(i = 0; i <  lista[nod].size(); i++ )
        if(viz[ lista[nod][i] ] != 0 )
            sortaret(lista[nod][i]);
    
    solutie.push_back(nod);
    
	
}

int main()
{
    int i;
  
    ifstream f("sortaret.in");
    ofstream g("sortaret.out");
    f>>n>>m;
    while(m){
             m--;
             f>>x>>y	;
             lista[x].push_back(y);
    }
 
    for( i = 1; i <= n ;i++)
        if(viz[i] == 0)
   	     sortaret(i);
   	                   
   	         
   	for( i = 0; i < solutie.size(); i++)
   	    g<<solutie[i]<<" ";

   
}