R=range
I=lambda:map(int,input().split())
T,m=I()
M=[m]*(m>1)
P=[]
def gcd(a,b):
	while a:a,b=b%a,a
	return b
while M:
	n=M.pop()
	if n<99:
		for i in R(2,n):
			if n%i<1:
				P+=[i]
				while n%i<1:n//=i
	else:
		for t in R(int(n**0.25)*2+9):
			x,d=int(n**0.5)+1,1
			y=(x*x+1)%n
			while d<2:x,y,d=(x*x+1)%n,(y**4+2*y*y+2)%n,gcd(abs(x-y),n)
			if d<n:
				M+=[d]
				while n%d<1:n//=d
				M+=[n]*(n>0)
				break
		else:P+=[n]
L=len(P)
Q=998244353
for t in R(T):
	N,B,C,D=I()
	A=list(I())
	b=[0]*N
	for i in R(L):
		n=m
		while n%P[i]<1:n//=P[i]
		for j in R(N):b[j]|=(A[j]%(m//n)>0)*1<<i
	W=[]
	for a in A:
		W+=[1+B*(m%a<1)]
		B=(C*B+D)%Q
	v=0
	for d in R(1<<L):
		w,S=1,[i for i in R(L)if d>>i&1]
		for j in R(N):w*=[1,W[j]][all(b[j]>>i&1for i in S)]
		v+=[w,-w][len(S)%2]
	print((v-(m<2))%Q)