#include<iostream>
#include<array>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<tuple>
#include<cassert>
using namespace std;
typedef long long ll;
typedef unsigned int ui;
const ll mod = 998244353;
const ll INF = (ll)1000000007 * 1000000007;
typedef pair<int, int> P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define Per(i,sta,n) for(int i=n-1;i>=sta;i--)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef long double ld;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<ll, ll> LP;
int dx[4]={1,-1,0,0};
int dy[4]={0,0,1,-1};
template<class T>bool chmax(T &a, const T &b) {if(a<b){a=b;return 1;}return 0;}
template<class T>bool chmin(T &a, const T &b) {if(b<a){a=b;return 1;}return 0;}

template<typename T>
struct Compress{
  vector<T> V;
  
  Compress(){
    V.clear();
  }
  Compress(vector<T> &V):V(V){}

  void add(T x){
    V.push_back(x);
  }

  int build(){
    sort(V.begin(),V.end());
    V.erase(unique(V.begin(),V.end()),V.end());
    return  V.size();
  }

  int get(T x){//get the index of the minimum element which is greater than x 
    return lower_bound(V.begin(),V.end(),x)-V.begin();
  }

  pair<int, int> section(T l,T r){//get the range of indexes of [l,r)
    int l_=get(l),r_=get(r);
    return pair<int,int>(l_,r_);
  }

  T &operator [] (int i) {return V[i];};
};

template<int mod>
struct ModInt {
    long long x;
    static constexpr int MOD = mod;
 
    ModInt() : x(0) {}
    ModInt(long long y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    explicit operator int() const {return x;}
 
    ModInt &operator+=(const ModInt &p) {
        if((x += p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator-=(const ModInt &p) {
        if((x += mod - p.x) >= mod) x -= mod;
        return *this;
    }
    ModInt &operator*=(const ModInt &p) {
        x = (int)(1LL * x * p.x % mod);
        return *this;
    }
    ModInt &operator/=(const ModInt &p) {
        *this *= p.inverse();
        return *this;
    }
 
    ModInt operator-() const { return ModInt(-x); }
    ModInt operator+(const ModInt &p) const { return ModInt(*this) += p; }
    ModInt operator-(const ModInt &p) const { return ModInt(*this) -= p; }
    ModInt operator*(const ModInt &p) const { return ModInt(*this) *= p; }
    ModInt operator/(const ModInt &p) const { return ModInt(*this) /= p; }
    ModInt operator%(const ModInt &p) const { return ModInt(0); }         
 
    bool operator==(const ModInt &p) const { return x == p.x; }
    bool operator!=(const ModInt &p) const { return x != p.x; }
 
    ModInt inverse() const{
        int a = x, b = mod, u = 1, v = 0, t;
        while(b > 0) {
            t = a / b;
            a -= t * b;
            swap(a, b);
            u -= t * v;
            swap(u, v);
        }
        return ModInt(u);
    }

    ModInt power(long long n) const {
        ModInt ret(1), mul(x);
        while(n > 0) {
            if(n & 1)
            ret *= mul;
            mul *= mul;
            n >>= 1;
        }
        return ret;
    }

    ModInt power(const ModInt p) const{
        return ((ModInt)x).power(p.x);
    }

    friend ostream &operator<<(ostream &os, const ModInt<mod> &p) {
        return os << p.x;
    }
    friend istream &operator>>(istream &is, ModInt<mod> &a) {
        long long x;
        is >> x;
        a = ModInt<mod>(x);
        return (is);
    }
};

using modint = ModInt<mod>;



int n,k,x,y,m=1024;
Compress<int> A;

vector<modint> Z[1024];
vector<modint> Y;

void calc(int siz,int sum,int pre){
  if(siz==n/2){
    Y[sum]+=1;
    Z[pre][sum]+=1;
    return;
  }
  rep(i,k){
    if(A[i]==pre) continue;
    calc(siz+1,sum^A[i],A[i]);
  }
}


void fwt(vector<modint>& f) {
    int n = f.size();
    for (int d = 1 ; d < n ; d <<= 1){
        for (int m = d << 1 ,i = 0;i < n ; i+=m){
            for (int j = 0 ; j < d ; j++){
                modint x = f[i+j],y = f[i+j+d];
                //xor;
                f[i+j]=x+y,f[i+j+d]=x-y;
                //and
                //a[i+j]=x+y;
                //or
                //a[i+j+d]=x+y;
            }
        }
    }
}

void ifwt(vector<modint>& f) {
    int n = f.size();
    modint inv2=((modint)2).inverse();
    for (int d = 1 ; d < n ; d<<=1){
        for (int m = d <<1, i = 0; i < n; i+=m){
            for (int j = 0 ; j < d ; j++){
                modint x = f[i+j],y = f[i+j+d];
                //xor
                f[i+j] = (x+y)*inv2,f[i+j+d]=(x-y)*inv2;
                //and
                //a[i+j] = x-y;
                //or
                //a[i+j+d] = y-x;
            }
        }
    }
}

void convolution(vector<modint> &A,vector<modint> &B,vector<modint> &C){
  fwt(A);
  rep(i,m){
    C[i]=A[i]*B[i];
  }
  ifwt(C);
}

void solve(){
  cin >> n >> k >> x >> y;
  rep(i,k){
    int a;cin >> a;
    A.add(a);
  }
  int k=A.build();
  Y.resize(m,0);
  rep(i,m) Z[i].resize(m,0);
  calc(0,0,-1);
  vector<modint> S(m);
  vector<vector<modint>> T(m,vector<modint>(m,0));
  //rep(i,20) cout << i << " " << Y[i] << endl;
  convolution(Y,Y,S);
  //rep(i,20) cout << i << " " << S[i] << endl;
  rep(i,m) convolution(Z[i],Z[i],T[i]);
  chmin(x,m);chmin(y,m);
  modint ans=0;
  Rep(i,x,y+1){
    ans+=S[i];
    rep(j,m){
      ans-=T[j][i];
    }
  }
  cout << ans << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << fixed << setprecision(50);
    solve();
}