long dp[1024][1024],sum[1024],ans;
a[1024],b[1024];
n,k,x,y;
i,j,q;
f(m,x,p){
	if(m==n/2)dp[x][p]++;
	else for(int i=0;i<k;i++)if(p!=a[i])f(m+1,x^a[i],a[i]);
}
main(){
	scanf("%d%d%d%d",&n,&k,&x,&y);
	for(i=0;i<k;i++)scanf("%d",&j),b[j]++;
	for(i=k=0;i<1024;i++)if(b[i])a[k++]=i;
	f(0,0,-1);
	for(i=0;i<1024;i++)for(j=0;j<1024;j++)sum[i]+=dp[i][j];
	for(i=0;i<1024;i++)for(j=0;j<1024;j++)if((i^j)>=x&(i^j)<=y){
		ans+=sum[i]*sum[j];
		for(q=0;q<1024;q++)ans-=dp[i][q]*dp[j][q];
	}
	printf("%d",ans%998244353);
}