#include <cstdio>
#include <vector>
#include <deque>
#include <iostream>

using namespace std;

#define maxN 50005
#define PB push_back
#define PF push_front


int N , M;
bool viz[maxN];

vector <int> lista[maxN];
deque <int> Q;


void dfs (int nod)
{
	if (viz[nod]) return;
	
	viz[nod] = true;
	Q.PB (nod);
	
	for (unsigned int i = 0 ; i < lista[nod].size () ; ++i)
	{
		int nodcur = lista[nod][i];
		
		if (viz[nodcur])
		{
			Q.pop_back ();
			Q.PF (nod);
			
			continue;
		}
		
		dfs (nodcur);
	}
}


int main ()
{
	freopen ("sortaret.in" , "r" , stdin);
	freopen ("sortaret.out" , "w" , stdout);
	
	scanf ("%d %d" , &N , &M);
	
	
	int a , b;
	
	for (int i = 1 ; i <= M ; ++i)
	{
		scanf ("%d %d" , &a , &b);
		
		lista[a].PB (b);
	}
	
	
	for (int i = 1 ; i <= N ; ++i)
	{
		if (viz[i]) continue;
		
		dfs (i);
	}
	
	
	while (!Q.empty ())
	{
		printf ("%d " , Q.front ());
		
		Q.pop_front ();
	}
	
	return 0;
}