#include<iostream>
#include<algorithm>
#define f first
#define s second
using namespace std;
int main()
{
	int n,m;
	cin>>n>>m;
	pair<int,int> in[m];
	pair<int,int> cnt[n+1];
	int ans[n]; ans[n-1]=2;
	int tmp[n+1];
	tmp[2]=n-1;
	for(int i = 0; i < n+1; ++i)
	{
		if(i==0)
		{
			cnt[0].f=-1;
		}
		else 
		{
			cnt[i].f=0; cnt[i].s=i;
		}
	}

	for(int i = 0; i < m; ++i)
	{
		cin>>in[i].f>>in[i].s;
		cnt[in[i].f].f++;
	}

	sort(cnt,cnt+n+1);

	for(int i = 0; i < n-1; ++i)
	{
		ans[i]=cnt[n-i].s;
		tmp[ans[i]]=i;
	}

	/*for(int i = 0; i < n; ++i)
	{
		cout<<ans[i]<<endl;
		cout<<tmp[ans[i]]<<endl;
	}*/

	for(int i = 0; i < m; ++i)
	{
		int l=in[i].f,r=in[i].s;
		if(tmp[l]>tmp[r])
		{
			ans[tmp[l]]=r;
			ans[tmp[r]]=l;

			int a=tmp[l];
			tmp[l]=tmp[r];
			tmp[r]=a;
		}
	}

	for(int i = 0; i < n; ++i)
	{
		cout<<ans[i]<<endl;
	}
  return 0;
}