#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define ALL(v) v.begin(),v.end()
typedef long long ll;

#include <bits/stdc++.h>
using namespace std;

const ll MOD=998244353;
ll dp[45][1030];

int main(){
  ll n,k,x,y;
  cin>>n>>k>>x>>y;
  
  set<ll> s;
  rep(i,k){
    ll c;
    cin>>c;
    s.insert(c);
  }
  
  ll u=s.size();
  
  dp[0][0]=1;
  for(int i=1;i<=n;i++){
    for(int j=0;j<1024;j++){
      if(i==2 && j==0) continue;
      for(auto t:s){
        dp[i][j]=(dp[i][j]+dp[i-1][j^t])%MOD;
      }
     if(i>2) dp[i][j]=(dp[i][j]-dp[i-2][j]*(u-1)%MOD+MOD)%MOD;
    }
  }
  ll sum=0;
  for(int i=x;i<=y;i++) sum=(sum+dp[n][i])%MOD;
  cout<<sum<<endl;

  return 0;
}