//starusc
#include<bits/stdc++.h>
using namespace std;
inline int read(){
	int x=0,f=1,c=getchar();
	while(!isdigit(c)){if(c=='-')f=-1;c=getchar();}
	while(isdigit(c)){x=(x<<1)+(x<<3)+(c^48);c=getchar();}
	return f==1?x:-x;
}
const int N=5e5+4;
int n,m,cn,cou,c[N],rt[N],p[N],q[N];
set<int>s[N];
vector<int>e[N];
inline void upd(int x,int y){
	rt[c[x]=c[y]=++cn]=x;
	s[cn].insert(x);s[cn].insert(y);
}
inline void solve(){
	n=read();m=read();
	for(int i=1,u,v;i<=m;i++){
		u=read();v=read();
		e[u].push_back(v);e[v].push_back(u);
	}
	for(int i=1;i<=n;i++)if((signed)e[i].size()==n-1)p[i]=q[i]=c[i]=++cou;
	for(int i=1,x;i<=n;i++)if(!c[i]){
		x=1;
		sort(e[i].begin(),e[i].end());
		e[i].push_back(n+1);
		for(auto v:e[i]){
			if(i==x)x++;
			if(v==x)x++;
			else break;
		}
		if(!c[x]){upd(i,x);continue;}
		if((signed)s[c[x]].size()==2||rt[c[x]]==x){
			s[c[x]].insert(i);
			rt[c[i]=c[x]]=x;
		}
		else{
			s[c[x]].erase(x);
			upd(i,x);
		}
	}
	for(int i=1;i<=cn;i++){
		p[rt[i]]=++cou;
		q[rt[i]]=cou+(signed)s[i].size()-1;
		for(auto v:s[i])if(v!=rt[i]){
			q[v]=cou;
			p[v]=++cou;
		}
	}
	for(int i=1;i<=n;i++)cout<<p[i]<<" ";puts("");
	for(int i=1;i<=n;i++)cout<<q[i]<<" ";puts("");
	cn=cou=0;
	memset(c,0,sizeof(int)*(n+1));
	for(int i=1;i<=n;i++){s[i].clear();e[i].clear();}
}
int main(){
	for(int T=read();T--;)solve();
	return (0-0);
}
