#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#include <list>
#define popcount __builtin_popcount
using namespace std;
typedef long long ll;
typedef pair<int, int> P;

int main()
{
    int n, k, x, y;
    cin>>n>>k>>x>>y;
    vector<int> a(k);
    for(int i=0; i<k; i++){
        cin>>a[i];
    }
    sort(a.begin(), a.end());
    a.erase(unique(a.begin(), a.end()), a.end());
    k=a.size();
    const ll MOD=998244353;
    auto dfs=[&](auto dfs, int s, int t, int m, vector<ll> &c){
        if(m==n/2-1){
            c[s]++;
            return;
        }
        for(int i=0; i<k; i++){
            if(i==t) continue;
            dfs(dfs, s^a[i], i, m+1, c);
        }
    };
    vector<ll> v(1024);
    vector<ll> vc[1024];
    for(int i=0; i<k; i++){
        vc[i].resize(1024);
        dfs(dfs, a[i], i, 0, vc[i]);
        for(int j=0; j<1024; j++) v[j]+=vc[i][j];
    }
    ll ans=0;
    for(int i=0; i<1024; i++) for(int j=0; j<1024; j++) if((i^j)>=x && (i^j)<=y) ans+=v[i]*v[j];
    for(int i=0; i<k; i++){
        for(int j=0; j<1024; j++) for(int l=0; l<1024; l++){
            if((j^l)>=x && (j^l)<=y) ans-=vc[i][j]*vc[i][l];
        }
    }
    cout<<ans%MOD<<endl;
    return 0;
}