#include<stdio.h>
#include<stdlib.h>

#define MAX 50003

FILE *f, *g;

int N, M, index;
unsigned long int viz[MAX];

typedef struct Node 
{	int info; 
	struct Node *next;
} Node;
Node *a[MAX], *list;

void file_open ()
{	f=fopen("sorttop.in", "r");
	g=fopen("sorttop.out", "w");
}


void file_close ()
{	fclose (f);
	fclose(g);
}

int add (int n1, int n2)
{	Node *ptr;
	if(!(ptr=(Node*)malloc(sizeof(Node))))
		return 0;
	ptr->info=n2;
	ptr->next=a[n1];
	a[n1]=ptr;
	return 1;
}

void read_node ()
{ 	int n1, n2;
	for(index=0; index<M; index++)
	{fscanf(f,"%d%d", &n1, &n2);
	 if(!(add(n1,n2)))
		{printf("eroare");
		 return ;
		}
	}
}

void write ()
{	Node *ptr;
	for(ptr=list;ptr;ptr=ptr->next)
   		fprintf(g,"%d ", ptr->info);
}


void DFS(int S)
{	Node *p, *ptr;
	viz[S]=1;
   	for(p=a[S]; p!=NULL; p=p->next)
     		if(viz[p->info]==0)
		     DFS(p->info);
	if(!(ptr=(Node*)malloc(sizeof(Node))))
		{printf("eroare");
		return;
		}
	ptr->info=S;
	ptr->next=list;
	list=ptr;		
}	



int main ()
{	file_open();
	fscanf(f,"%d %d", & N, &M);
	read_node();
	for(index=1;index<=N;index++)
	if(viz[index]==0)
		DFS(index);
	write();
	file_close();
	return 0;
}