Nezzar designs a brand new game "Hidden Permutations" and shares it with his best friend, Nanako.

At the beginning of the game, Nanako and Nezzar both know integers n and m. The game goes in the following way:

  * Firstly, Nezzar hides two permutations p_1,p_2,…,p_n and q_1,q_2,…,q_n of integers from 1 to n, and Nanako secretly selects m unordered pairs (l_1,r_1),(l_2,r_2),…,(l_m,r_m); 
  * After that, Nanako sends his chosen pairs to Nezzar; 
  * On receiving those m unordered pairs, Nezzar checks if there exists 1 ≤ i ≤ m, such that (p_{l_i}-p_{r_i}) and (q_{l_i}-q_{r_i}) have different signs. If so, Nezzar instantly loses the game and gets a score of -1. Otherwise, the score Nezzar gets is equal to the number of indices 1 ≤ i ≤ n such that p_i ≠ q_i. 



However, Nezzar accidentally knows Nanako's unordered pairs and decides to take advantage of them. Please help Nezzar find out two permutations p and q such that the score is maximized.

Input

The first line contains a single integer t (1 ≤ t ≤ 5 ⋅ 10^5) — the number of test cases.

The first line of each test case contains two integers n,m (1 ≤ n ≤ 5 ⋅ 10^5, 0 ≤ m ≤ min((n(n-1))/(2),5 ⋅ 10^5)). 

Then m lines follow, i-th of them contains two integers l_i,r_i (1 ≤ l_i,r_i ≤ n, l_i ≠ r_i), describing the i-th unordered pair Nanako chooses. It is guaranteed that all m unordered pairs are distinct.

It is guaranteed that the sum of n for all test cases does not exceed 5 ⋅ 10^5, and the sum of m for all test cases does not exceed 5⋅ 10^5.

Output

For each test case, print two permutations p_1,p_2,…,p_n and q_1,q_2,…,q_n such that the score Nezzar gets is maximized.

Example

Input


3
4 2
1 2
3 4
6 4
1 2
1 3
3 5
3 6
2 1
1 2


Output


1 2 3 4
3 4 1 2
2 3 4 1 6 5
1 4 3 2 5 6
1 2
1 2

Note

For first test case, for each pair given by Nanako:

  * for the first pair (1,2): p_1 - p_2 = 1 - 2 = -1, q_1 - q_2 = 3 - 4 = -1, they have the same sign; 
  * for the second pair (3,4): p_3 - p_4 = 3 - 4 = -1, q_3 - q_4 = 1 - 2 = -1, they have the same sign. 



As Nezzar does not lose instantly, Nezzar gains the score of 4 as p_i ≠ q_i for all 1 ≤ i ≤ 4. Obviously, it is the maximum possible score Nezzar can get.
#include <stdio.h>
#include <queue>
#include <vector>
#include <set>
#define MN 500000

using std::queue;
using std::set;
using std::vector;

int p[MN+5],q[MN+5];
set<int> e[MN+5];

struct object{
	static int minVal;
	static void clear(){
		minVal = 1;
	}
	static int get(int k){
		int r = minVal;
		minVal += k;
		return r;
	}
}o;

int object::minVal;

struct tree{
	vector<int> e[MN+5];
	vector<int> f[MN+5];
	bool nd[MN+5];
	void clear(int n){
		for(int i=1;i<=n;i++){
			e[i].clear();
			f[i].clear();
			nd[i] = false;
		}
	}
	void add(int u,int v){
		e[u].push_back(v);
		e[v].push_back(u);
		nd[u] = nd[v] = true;
	}
	bool dfs(int u,int fa){
		nd[u] = false;
		int isCore = -1;
		for(auto v:e[u]){
			if(v==fa) continue;
			if(dfs(v,u)){
				isCore = v;
			}else{
				f[u].push_back(v);
			}
		}
		if(!f[u].size()){
			if(fa==0)
				f[isCore].push_back(u);
			return false;
		}else{
			return true;
		}
	}
	void solve(int n){
		for(int i=1;i<=n;i++)
			if(nd[i])
				dfs(i,0);
		for(int i=1;i<=n;i++){
			if(f[i].size()){
				int S = o.get(f[i].size()+1);
				p[i] = S+f[i].size();
				q[i] = S;
				for(int j=0;j<(int)f[i].size();j++){
					p[f[i][j]] = S+j;
					q[f[i][j]] = S+j+1;
				}
			}
		}
	}
}T;

void solve(){
	int n,m;
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++)
		e[i].clear();
	o.clear();
	T.clear(n);
	for(int i=1,u,v;i<=m;i++){
		scanf("%d%d",&u,&v);
		e[u].insert(v);
		e[v].insert(u);
	}
	{
		set<int> uc;
		for(int i=1;i<=n;i++)
			if((int)e[i].size()>=n-1)
				p[i] = q[i] = o.get(1);
			else
				uc.insert(i);
		queue<int> q;
		while(!uc.empty()){
			int u;
			if(!q.empty()){
				u = q.front();
				q.pop();
			}else{
				u = *uc.begin();
				uc.erase(uc.begin());
			}
			vector<int> its;
			for(auto v:uc){
				if(e[u].find(v)!=e[u].end()) continue;
				its.push_back(v);
				T.add(u,v);
				q.push(v);
			}
			for(auto v:its){
				uc.erase(v);
			}
		}
	}
	T.solve(n);
	for(int i=1;i<=n;i++)
		printf("%d ",p[i]);
	puts("");
	for(int i=1;i<=n;i++)
		printf("%d ",q[i]);
	puts("");
}

int main(){
	int T; scanf("%d",&T);
	while(T--) solve(); 
}










