#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include <bits/stdc++.h>
using namespace std;
typedef long long int ll;

struct fastI{
    char in[1<<26];
    char const*o;
    fastI(){
        o = in; 
        in[fread(in,1,sizeof(in)-4,stdin)]=0;
    }
    fastI& operator>>(char& c){
        while(*o&&*o<=32)++o;
        c=*o++;
        return *this;
    }
    fastI& operator>>(int& u){
        u=0; 
        unsigned s=0;
        while(*o&&*o<=32)++o;
        if (*o == '-')s = ~s, ++o; else if (*o == '+')++o;
        while('0'<=*o && *o<='9')u = (u<<3) + (u << 1) + (*o++ - '0');
        (u^=s)+=!!s;
        return *this;
    }
    fastI& operator>>(long long& u){
        u=0;
        uint64_t s=0;
        while(*o&&*o<=32)++o;
        if (*o == '-')s = ~s, ++o; else if (*o == '+')++o;
        while('0'<=*o && *o<='9')u = (u<<3) + (u << 1) + (*o++ - '0');
        (u^=s)+=!!s;
        return *this;
    }
} fin;

constexpr ll mod=998244353;

ll dp[42][1024];

int main(){
	int n,k,x,y; fin >> n >> k >> x >> y;
	vector<int> a(k);
	for(int i=0;i<k;i++){
		fin >> a[i];
	}
	sort(a.begin(), a.end());
	a.erase(unique(a.begin(), a.end()),a.end());
	k=a.size();
	dp[0][0]=1;
	for(int i=0;i<n;i++){
		for(int j=0;j<1024;j++){
			if(dp[i][j]==0)continue;
			for(int K:a){
				dp[i+1][j^K]+=dp[i][j];
			}
			(dp[i+2][j]-=dp[i][j]*(k-(i>0)));
		}
	}
	ll res=0;
	for(int i=x;i<=min(1023,y);i++){
		res+=dp[n][i];
	}
	res%=mod;
	cout << res << endl;
}