#include<stdio.h>
#include<list>
using namespace std;
#define N 50005
#define pb push_back
int n,m;
int deg[N],cate[N],sol[N];
list<int> a[N];
void citire()
{
	int x,y;
	scanf("%d%d",&n,&m);
	for(int i=0; i<m; i++)
	{
		scanf("%d%d",&x,&y);
		a[x].pb(y);
		deg[y]++;
	}
}
void rezolva()
{
	int i,x;
	for(i=1; i<=n; i++)
		if(!deg[i])
			sol[++sol[0]]=i;
	for(i=1; i<=sol[0]; i++)
	{
		x=sol[i];
		for(list<int>::iterator it=a[x].begin(); it!=a[x].end(); ++it)
		{
			--deg[*it];
			if(!deg[*it])
				sol[++sol[0]]=*it;
		}
	}
}
void scrie()
{
	for(int i=1; i<sol[0]; i++)
		printf("%d ",sol[i]);
	printf("%d\n",sol[n]);
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	citire();
	rezolva();
	scrie();
	return 0;
}