#include <cstdio>
#include <algorithm>

using namespace std;

FILE *f=fopen("sortaret.in","r"),*s=fopen("sortaret.out","w");

struct abi{
	int x;
	int y;
};

int n, m, a, b, aux, i, j;

abi v[50001],aux2;

/*int cmp(abi k, abi l)
{
	if(k.y<l.y)
		return 1;
	return 0;
}*/

int main()
{
	fscanf(f,"%d %d",&n,&m);
	
	aux=m;
	
	while(aux--)
	{
		fscanf(f,"%d %d",&a,&b);
		v[a].x=a;
		v[a].y++;
		v[b].x=b;
		v[b].y++;
	}
	
	for(i=1;i<m;i++)
		for(j=i+1;j<=m;j++)
			if(v[i].y>v[j].y)
				aux2=v[i], v[i]=v[j], v[j]=aux2;
	
	//sort(v[0],v[500001],cmp);
	
	for(i=1;i<=m;i++)
		fprintf(s,"%d ",v[i].x);
	
	
	fclose(s);
	
	
	return 0;
}