#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for(int i = 0; i < (n); i++)
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
constexpr int mod = 998244353;
struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }
 
  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};

constexpr int AMAX = 1024;
int main() {  
  int n, K, x, y;
  cin >> n >> K >> x >> y;
  vector<int> a(K);
  rep(i,K) cin >> a[i];

  sort(a.begin(), a.end());
  a.erase(unique(a.begin(), a.end()), a.end());
  K = (int)a.size();

  vector<vector<mint>> dp(n + 1, vector<mint>(AMAX, 0));
  
  dp[0][0] = 1;

  for (int i = 0; i < n; i++) {
    for (int j = 0; j < AMAX; j++) {
      for (int k = 0; k < K; k++) dp[i + 1][j] += dp[i][j ^ a[k]];
      if (i == 1) dp[i + 1][j] -= dp[0][j] * K;
      else if (i >= 2) dp[i + 1][j] -= dp[i - 1][j] * (K - 1);
    }
  }
  mint res = 0;
  x = min(1023, x);
  y = min(1023, y);
  for ( int i = x; i <= y; i++) {
    res += dp[n][i];
  }
  cout << res.x << endl;
  return 0;
}