#include<stdio.h>
#include<vector>
#include<queue>


using namespace std;


queue<int> q;
vector<int> a[50003];
int p[50003];





int main()
{
	freopen("sortaret.in","r",stdin);
	freopen("sortaret.out","w",stdout);
	int n,m,i,x,y;
	scanf("%d%d",&n,&m);
	for(i=1;i<=m;++i)
	{
		scanf("%d%d",&x,&y);
		a[x].push_back(y);
		p[y]++;
	}
	for(i=1;i<=n;++i)
		if(p[i]==0)
			q.push(i);
	while(!q.empty())
	{
		x=q.front();
		y=a[x].size();
		for(i=0;i<y;++i)
		{
			--p[a[x][i]];
			if(p[a[x][i]]==0)
				q.push(a[x][i]);
		}
		printf("%d ",x);
		q.pop();
	}
	printf("\n");
	return 0;
}