#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=(1<<20)+5,M=(1<<20)+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(28382);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int type,n,m,nn,mm;
vector<pii> e;
void con(int x,int y){e.emplace_back(x,y);}
namespace Solve1{
	void Solve(){
		vector<pii> e;
		for(int i=1;i<=nn;i++){
			for(int j=i+1;j<=nn;j++) if(i%(n-1)!=j%(n-1)) con(i,j);
		}
	}
}
namespace Solve2{
	int p;
	int getid(int x,int y){return x*p+y+1;}
	bool ckp(int x){
		for(int i=2;i*i<=x;i++) if(x%i==0) return false;
		return true;
	}
	void Solve(){
		p=sqrt(nn);
		while(!ckp(p)) p--;
		for(int i=0;i<p;i++) for(int j=0;j<p;j++){
			for(int h=i+1;h<p;h++) con(getid(i,j),getid(h,(i*h+p-j)%p));
		}
	}
}
namespace Solve3{
	int p=7;
	int getid(int x,int y,int z){return x*p*p+y*p+z+1;}
	void Solve(){
		for(int x=0;x<p;x++) for(int y=0;y<p;y++) for(int z=0;z<p;z++){
			for(int a=0;a<p;a++) for(int b=0;b<p;b++) for(int c=0;c<p;c++){
				int w=((x-a)*(x-a)+(y-b)*(y-b)+(z-c)*(z-c))%p;
				if(w==1) con(getid(x,y,z),getid(a,b,c));
			}
		}
		for(auto &[a,b]:e) if(a>b) swap(a,b);
		sort(all(e));
		e.erase(unique(all(e)),e.end());
	}
}
void Solve(){
	scanf("%d%d",&n,&m);
	e.clear();
	while(m--){
		int x,y;scanf("%d%d",&x,&y);
	}
	scanf("%d%d",&nn,&mm);
	if(type<=2) Solve1::Solve();
	else if(type<=5) Solve2::Solve();
	else Solve3::Solve();
	printf("%d %d\n",nn,int(e.size()));
	for(auto [a,b]:e) printf("%d %d\n",a,b);
}
int main(){
	int t=1;
	scanf("%d%d",&t,&type);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}