#include //#include #pragma GCC target("avx") #pragma GCC optimize("O3") #pragma GCC optimize("unroll-loops") //namespace mp = boost::multiprecision; //using Bll = mp::cpp_int; using namespace std; #define ll long long #define rep(i, m, n) for (ll i = m; i < n; i++) #define rrep(i, m, n) for (ll i = m - 1; i >= n; i--) #define pb(n) push_back(n) #define UE(N) N.erase(unique(N.begin(), N.end()), N.end()); #define Sort(n) sort(n.begin(), n.end()) #define Rev(n) reverse(n.begin(), n.end()) #define HpOut(S) cout << setprecision(50) << S << endl #define Vec(K, L, N, S) vector K(N, S) #define DV(K, L, N, M, S) vector> K(N, vector(M, S)) #define TV(K, L, N, M, R, S) \ vector>> K(N, vector>(M, vector(R, S))) #define pint pair #define tint tuple #define paf(L, R) pair #define mod 998244353 #define MAX 10010 #define ALL(a) a.begin(), a.end() #define chmax(a, b) a = (((a) < (b)) ? (b) : (a)) #define chmin(a, b) a = (((a) > (b)) ? (b) : (a)) int main(){ cin.tie(nullptr); ios::sync_with_stdio(false); ll N, K, X, Y; cin >> N >> K >> X >> Y; vector> dp(N + 2, vector(1024, 0)); vector A(K); rep(i, 0, K) cin >> A[i]; Sort(A); UE(A); K = A.size(); dp[0][0] = 1; rep(i, 0, N) { rep(j, 0, 1024) { rep(k, 0, K) dp[i + 1][j ^ A[k]] = (dp[i + 1][j ^ A[k]] + dp[i][j]) % mod; if(!i) dp[i + 2][j] = (dp[i + 2][j] - dp[i][j] * K + mod) % mod; else dp[i + 2][j] = (dp[i + 2][j] - dp[i][j] * (K - 1) + mod) % mod; } } ll res=0; rep(i, 0, 1024) if(X <= i & i <= Y) res = res + dp[N][i]; cout << res % mod << endl; }