#include <bits/stdc++.h>
using namespace std;
const int N=1e5+5;
const int M=4e5+5;
int ans1[N],ans_cnt1,ans2[N],p[N],ans_cnt2;
int head[N],nex[M],e[M],idx;
void add(int u,int v)
{
	e[idx]=v,nex[idx]=head[u],head[u]=idx++;
}
bool vis[N];
int a[N];
void dfs(int u)
{
	ans1[++ans_cnt1]=u;
	int len=0;
	for (int i=head[u];i!=-1;i=nex[i])
	{
		if (vis[e[i]]==0) a[++len]=e[i];
	}
	sort(a+1,a+len+1);
	for (int i=1;i<=len;i++)
	{
//		printf("%d\n",a[i]);
		vis[a[i]]=1;
		dfs(a[i]);
	}
}
int main()
{
	freopen("graperm.in","r",stdin);
	freopen("graperm.out","w",stdout);
	int c,T;
	scanf("%d%d",&c,&T);
	while (T--)
	{
		memset(head,-1,sizeof head);
		memset(vis,0,sizeof vis);
		idx=0;
		int n,m;
		scanf("%d%d",&n,&m);
		for (int i=1;i<=m;i++)
		{
			int u,v;
			scanf("%d%d",&u,&v);
			add(u,v);
			add(v,u);
		}
		ans_cnt1=0;
		ans_cnt2=0;
		for (int i=1;i<=n;i++)
		{
			if (vis[i]==0)
			{
				vis[i]=1;
				dfs(i);
				if (ans_cnt2==0)
				{
					for (int i=1;i<=ans_cnt1;i++)
						ans2[++ans_cnt2]=ans1[i];
				}
				else
				{
					int k=ans_cnt2+1;
					for (int i=1;i<=ans_cnt2;i++)
					{
						if (ans2[i]>ans1[1]) 
						{
							k=i;
							break;
						}
					}
					for (int i=k;i<=ans_cnt2;i++)
						p[i]=ans2[i];
					for (int i=k;i<=ans_cnt2;i++)
						ans2[i+ans_cnt1]=p[i];
					for (int i=k;i<=ans_cnt1+k-1;i++)
						ans2[i]=ans1[i-k+1];
					ans_cnt2+=ans_cnt1;
				}
				ans_cnt1=0;
			}
		}
		for (int i=1;i<=n;i++)
			printf("%d ",ans2[i]);
		printf("\n");
		
	}
	return 0;
}