#include <bits/stdc++.h>
#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
using namespace std;
#define ll long long
#define rep(i, m, n) for (ll i = m; i < n; i++)
#define mod 998244353

void fwt(vector<ll>& f) {
    int n = f.size();
    for(int i = 1; i < n; i <<= 1) {
        for(int j = 0; j < n; j++) {
            if((j & i) == 0) {
                ll x = f[j], y = f[j | i];
                f[j] = x + y, f[j | i] = x - y;
            }
        }
    }
}

void ifwt(vector<ll>& f) {
    int n = f.size();
    for(int i = 1; i < n; i <<= 1) {
        for(int j = 0; j < n; j++) {
            if((j & i) == 0) {
                ll x = f[j], y = f[j | i];
                f[j] = (x + y) * 499122177 % mod, f[j | i] = (x - y) * 499122177 % mod;
            }
        }
    }
}

int main(){
	cin.tie(nullptr);
	ios::sync_with_stdio(false);
	ll N, K, X, Y; 
    cin >> N >> K >> X >> Y;
	ll M = 262144;
	vector<vector<ll>> dp(N + 2, vector<ll>(M, 1));
    vector<ll> H(M, 0);
    rep(i, 0, K) {
		ll A;
		cin >> A;
		H[A] = 1;
	}
	fwt(H);
    rep(v, 0, M) dp[1][v] = dp[0][v] * H[v];
    rep(v, 0, M) dp[2][v] = dp[1][v] * H[v] - K * dp[0][v];
	rep(i, 3, N + 1) rep(v, 0, M) dp[i][v] = (dp[i - 1][v] * H[v] - (K - 1) * dp[i - 2][v] + mod) % mod;
	ifwt(dp[N]);
	ll res = 0;
	rep(v, 0, M) if(X <= v & v <= Y) res = (res + dp[N][v]) % mod;
	cout << (res + mod) % mod << endl;
}