#include<bits/stdc++.h>

#define MOD 330301441
#define MAX 100005
#define ll long long
#define slld(t) scanf("%lld",&t)
#define sd(t) scanf("%d",&t)
#define ss(x) scanf("%s",x)
#define pd(t) printf("%d\n",t)
#define plld(t) printf("%lld\n",t)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tr(container,it) for(typeof(container.begin()) it=container.begin();it!=container.end();it++)
#define mp(a,b) make_pair(a,b)
#define FF first
#define SS second
#define pb(x) push_back(x)
#define vi vector<int>
#define vpii vector<pii >
#define vll vector<ll>
#define clr(x) memset(x,0,sizeof(x))

#define FILEIO(name) \
    freopen(name".in", "r", stdin); \
    freopen(name".out", "w", stdout);

using namespace std;

ll power(ll a,ll b,ll m){
	if(!a) return b?0:1;
	ll x=1; a%=m;
	while(b){
		if((1&b)) x = x * a % m;
		a = a * a % m;
		b >>= 1;
	}
	return x;
}

// Multidimensional dft computation
ll poly[1<<21];	// will be used to store multivariate polynomial
int k[22];

ll w[]={0,1,330301440,237065193,290591153,322558105,237065194,273067711,239383794,256120685,168367411};
ll pw[101], eval[11];

void DFT(int dimensions,int K,bool invert=0){
	pw[0]=1;
	pw[1]=invert?power(w[K],MOD-2,MOD):w[K];
	for(int i=2;i<=K*K;i++) pw[i]=pw[i-1]*pw[1]%MOD;

	// O(dimensions*K^(dimensions-1)*K^2)
	for(int i=1;i<=dimensions;i++){
		int left=k[i-1];
		int right=k[dimensions-i];
		for(int m=0;m<left;m++){
			for(int n=0;n<right;n++){
				int index=m*k[dimensions-i+1]+n;

				// compute the size K DFT of poly[index+j*k[dimensions-i]]*x^j for j<K
				for(int pwers=0;pwers<K;pwers++){
					eval[pwers]=0;
					for(int j=0;j<K;j++){
						eval[pwers]+=poly[index+j*k[dimensions-i]]*pw[pwers*j];
						if(eval[pwers]>=MOD) eval[pwers]%=MOD;
					}
				}
				for(int j=0;j<K;j++) poly[index+j*k[dimensions-i]]=eval[j];
			}
		}
	}

	if(invert){
		ll divide=power(k[dimensions],MOD-2,MOD);
		for(int i=0;i<k[dimensions];i++) poly[i]=poly[i]*divide%MOD;
	}
}
// ENDS

int cnt[MAX];
ll p2[MAX];

int main(){
	int t;sd(t);
	p2[0]=1;
	for(int i=1;i<MAX;i++) p2[i]=(2*p2[i-1])%MOD;
	while(t--){
		int n,K;
		sd(n);sd(K);
		ll X;
		slld(X); X%=(MOD-1);
		
		clr(cnt);
		for(int i=1;i<=n;i++){
			int x;sd(x);
			cnt[x]++;
		}

		int LIM=0;
		clr(poly);
		int pp=0;
		ll w=1;
		for(int i=0;i<=n;i++){
			pp+=cnt[i];
			poly[i]=w*p2[n-pp]%MOD;
			w=w*(p2[cnt[i]]-1+MOD)%MOD;
			if(poly[i]) LIM=i;
		}

		int dimensions=0;
		int sm = 0 , p=1;
		while(1){
			sm+=p;p*=K;
			dimensions++;
			if(sm*(K-1)>=LIM) break;
		}
		k[0]=1;
		for(int i=1;i<=dimensions;i++) k[i]=k[i-1]*K;

		DFT(dimensions,K);
		for(int i=0;i<k[dimensions];i++) poly[i]=power(poly[i],X,MOD);
		DFT(dimensions,K,1);

		ll M=p2[n];
		ll ans=0,den=power(M,X,MOD);
		den=power(den,MOD-2,MOD);
		for(int i=0;i<k[dimensions];i++){
			ans+=power(i,2*i,MOD)*power(poly[i]*den,3*i,MOD);
			ans%=MOD;
		}

		plld(ans);
	}
}