//-DYUNQIAN -std=c++14 -O2 -Wall
#include<bits/stdc++.h>

#define ll long long

using namespace std;

inline int read(){
	int x=0,f=1;char c=getchar();
	for(;(c<'0'||c>'9');c=getchar()){if(c=='-')f=-1;}
	for(;(c>='0'&&c<='9');c=getchar())x=x*10+(c&15);
	return x*f;
}

const int mod=1e9+7;
int ksm(int x,int y,int p=mod){
	int ans=1;
	for(int i=y;i;i>>=1,x=1ll*x*x%p)if(i&1)ans=1ll*ans*x%p;
	return ans%p;
}
int inv(int x,int p=mod){return ksm(x,p-2,p)%p;}
mt19937 rnd(time(0));
int randint(int l,int r){return rnd()%(r-l+1)+l;}
void add(int &x,int v){x+=v;if(x>=mod)x-=mod;}
void Mod(int &x){if(x>=mod)x-=mod;}

void Assert(bool c,int L=0){if(!c){cout<<"Assertion Failed at "<<L<<endl;exit(0);}}

void cmax(int &x,int v){x=max(x,v);}
void cmin(int &x,int v){x=min(x,v);}

set<pair<int,int> >S;

#define fi first
#define se second
#define mk make_pair

vector<int>nosol;
vector<int> getans(vector<pair<int,int> >&D,int m,int k){
	vector<int>ans;
	S.clear();for(auto t:D)S.insert(t);
	for(int t=1;t<=m;t++){
		if(S.size()==1){
			auto p=S.begin();int x=p->fi,i=p->se;
			if(x<k)return nosol;
			ans.emplace_back(i),ans.emplace_back(k),ans.emplace_back(-1);
			S.erase(p);if(x>k)S.insert(mk(x-k,i));
			continue;
		}
		auto p=S.begin();S.erase(p);
		int x=p->fi,i=p->se;
		if(x>=k){
			ans.emplace_back(i),ans.emplace_back(k),ans.emplace_back(-1);
			x-=k;if(x)S.insert(mk(x,i));
			continue;
		}
		auto q=S.lower_bound(mk(k-x,-1));
		if(q==S.end())return nosol;
		int j=q->se,y=q->fi;
		ans.emplace_back(i),ans.emplace_back(x),ans.emplace_back(j),ans.emplace_back(k-x),ans.emplace_back(-1);
		S.erase(q),y-=(k-x);if(y)S.insert(mk(y,j));
	}
	return ans;
}

vector<pair<int,int> >D;
const int N=505;
const int M=500*5000+5;
const int Z=500*5000;
int d[N],n,m,k;
bitset<M*2>f[N];
bool vis[N];

const int YeShou=1145141919;

void getD(int x,int S){
	if(x==0)return ;
	if(d[x]-k<=S&&f[x-1][S-(d[x]-k)])D.emplace_back(mk(d[x],x)),getD(x-1,S-(d[x]-k)),vis[x]=1;
	else getD(x-1,S);
}
void print(vector<int>&vec){
	for(auto x:vec){
		if(x==-1)puts("");
		else cout<<x<<" ";
	}
}

vector<int>ans1,ans2;
void solve(){
	n=read(),m=read(),k=read();
	for(int i=1;i<=n;i++)d[i]=read();
	
	if(m>=n-1){
		D.clear();
		for(int i=1;i<=n;i++)D.emplace_back(mk(d[i],i));
		auto ans=getans(D,m,k);
		print(ans);return ;
	}
	
	for(int i=0;i<=n;i++)f[i]=0;
	f[0][Z]=1;
	for(int i=0;i<n;i++){
		if(d[i+1]>k)f[i+1]=(f[i]|(f[i]<<(d[i+1]-k)));
		else f[i+1]=(f[i]|(f[i]>>(k-d[i+1])));
	}
	if(!f[n][Z-k])return puts("-1"),void();
	D.clear();
	for(int i=1;i<=n;i++)vis[i]=0;
	getD(n,Z-k);
	ans1=getans(D,D.size()-1,k);
	D.clear();for(int i=1;i<=n;i++)if(!vis[i])D.emplace_back(mk(d[i],i));
	ans2=getans(D,D.size()-1,k);
	
	if(ans1.size()==1&&ans1[0]==YeShou)return puts("-1"),void();
	if(ans2.size()==1&&ans2[0]==YeShou)return puts("-1"),void();
	
	print(ans1),print(ans2);
}

signed main(void){

// 	freopen("dish.in","r",stdin);
// 	freopen("dish.out","w",stdout);
	
	nosol.resize(1),nosol[0]=YeShou;
	int tt=read();while(tt--)solve();

	return 0;
}