#include<iostream>
#include<string>
#include<algorithm>
#include<vector>
#include<iomanip>
#include<math.h>
#include<complex>
#include<queue>
#include<deque>
#include<stack>
#include<map>
#include<set>
#include<bitset>
#include<functional>
#include<assert.h>
#include<numeric>
using namespace std;
#define REP(i,m,n) for(int i=(int)(m) ; i < (int) (n) ; ++i )
#define rep(i,n) REP(i,0,n)
using ll = long long;
constexpr int inf=1e9+7;
constexpr ll longinf=1LL<<60 ;
constexpr ll mod=998244353 ;

ll dp[30][30][1024];

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,k,x,y;
    cin>>n>>k>>x>>y;
    vector<int> a(k);
    rep(i,k)cin>>a[i];
    dp[0][k][0]=1;
    rep(i,n){
        rep(j,k){
            rep(l,1024){
                rep(t,k+1)if(t!=j)dp[i+1][j][l]+=dp[i][t][l^a[j]];
            }
        }
    }
    ll ans = 0;
    rep(j,k)REP(t,x,y+1)ans+=dp[n][j][t];
    cout<<ans%mod<<endl;
    return 0;
}