#include<stdio.h>
#include<vector>
#include<stdlib.h>
using namespace std;
vector<int> v[50005];
int tim=0,n,m;
struct Black {int ttm,ind;};
Black black[50005];
int viz[50005];
int MyComp(const void *a,const void *b)
{
	Black *pa,*pb;
	pa=(Black*)a;
	pb=(Black*)b;
	return pb->ttm-pa->ttm;
}
void dfs(int x)
{
	viz[x]=1;
	vector<int>::iterator it;
	for(it=v[x].begin();it!=v[x].end();it++)
		if(!viz[*it]) dfs(*it);
	black[x].ttm=++tim;
}
int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	int x,y,i;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;i++)
	{
		scanf("%d%d",&x,&y);
		v[x].push_back(y);
	}
	dfs(1);
	for(i=1;i<=n;i++)
		black[i].ind=i;
	qsort(black+1,n,sizeof(black[0]),MyComp);
	for(i=1;i<=n;i++)
		printf("%d ",black[i].ind);
	printf("\n");
return 0;
}