#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#define int long long
using namespace std;
int read(){
	int res=0,fg=1;char c=getchar();
	while(c<'0'||c>'9'){if(c=='-')fg=-1;c=getchar();}
	while(c>='0'&&c<='9')res=(res<<3)+(res<<1)+c-'0',c=getchar();
	return res*fg;
}
void write(int x){
	if(x<0)putchar('-'),x=-x;
	if(x>9)write(x/10);
	putchar(x%10+'0');
}
const int maxn=2e5+5;
const int mod=1e9+7;
int n,m,V;
int qpow(int x,int y){int res=1;for(;y;y>>=1,x=x*x%mod)if(y&1)res=res*x%mod;return res;}
map<int,int>mp;
void solve(){
	n=read(),m=read();
	//debug深入思考，只靠样例和自己 
}
signed main(){
	int T=read();
	while(T--)solve();
	return 0;
}
