//#pragma GCC optimize ("O2")
//#pragma GCC target ("avx2")
#include<bits/stdc++.h>
//#include<atcoder/all>
//using namespace atcoder;

using namespace std;
typedef long long ll;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define rep1(i, n) for(int i = 1; i <= (n); i++)
#define co(x) cout << (x) << "\n"
#define cosp(x) cout << (x) << " "
#define ce(x) cerr << (x) << "\n"
#define cesp(x) cerr << (x) << " "
#define pb push_back
#define mp make_pair
#define chmin(x, y) x = min(x, y)
#define chmax(x, y) x = max(x, y)
#define Would
#define you
#define please


int main() {
	cin.tie(0);
	ios::sync_with_stdio(false);


	int N, K, X, Y;
	cin >> N >> K >> X >> Y;

	int A[1025] = {};
	rep(i, K) {
		int a;
		cin >> a;
		A[a]++;
	}

	ll dat1[1025][1025] = {}, dat2[1025][1025] = {};
	auto mae = dat1;
	auto tugi = dat2;
	mae[1024][0] = 1;
	A[1024] = 1;

	rep(n, N) {
		rep(k, 1024) if (A[k]) {
			auto tmp1 = tugi[k];
			int a = A[k];
			rep(j, 1025) if (A[j]) {
				auto tmp2 = mae[j];
				if (j == k) {
					rep(i, 1024) {
						tmp1[i ^ k] += tmp2[i] * (a - 1);
					}
				}
				else {
					rep(i, 1024) {
						tmp1[i ^ k] += tmp2[i] * a;
					}
				}
			}
		}
		rep(i, 1025) rep(j, 1025) mae[i][j] = 0;
		swap(tugi, mae);
	}

	ll kotae = 0;
	rep(i, 1025) rep(j, 1025) {
		if (X <= j && j <= Y) {
			kotae += mae[i][j];
		}
	}

	co(kotae % 998244353);

	Would you please return 0;
}