#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
const int M=2e6+5;
int T;
int n,m,k;
int a[M];
int s1[M],s2[M];
queue<int> q1,q2;
int main()
{
	freopen("meow.in","r",stdin);
	freopen("meow.out","w",stdout);
	scanf("%d",&T);
	while(T--)
	{
		scanf("%d%d%d",&n,&m,&k);
		for(int i=1;i<=m;++i)
		{
			scanf("%d",&a[i]);
		}
		s1[1]=a[1];
		for(int i=2;i<=m;++i)
		{
		}
	}
	return 0;
}
/*
2022.11.26 the NOIP competition;
wulunjieguoruhe zheduanshijiandejingli dounanyiwangque
yiqunzhitongdaohederen nenggouxiangchuzhezhengzhenglianggeyue
zhendehaokaixing yexuwoshilibuxingmeiyouhuojiang haiyouxiehuobanyaoAFO
danshi zheduoshiguangdehuangxiao nuli laoshidefuchu jiangyongyuanmingji
xiwangdajiadouyouyigemeihaodeweilai
suirandaolegaozhong danshiwohaishihaohuainianwodechuzhongtongxue
gxsy 2204 yongyuanshiwodejia
lrz hjj hjx zyj ljh jcx zqy zkw dengdeng
haohuainiana
yexu wohaijideni haixihuangzheniba still like someone

zuihou xiegeiwoxihuandeyouxi yuangsheng hutaoyidingyaochoudao!!!
from jmyzqchm
*/
