#include<iostream>
#include<vector>

using namespace std;
using ll = long long;

int min(int x, int y) {
    if (x > y) {
        return y;
    }
    else {
        return x;
    }
}

int main() {
    int N, K, X, Y;
    cin >> N >> K >> X >> Y;
    ll Mod = 998244353;
    ll T = 1023;
    
    vector<int> A(K, 0);
    for (int i = 0; i < K; i++) {
        cin >> A[i];
    }

    vector<vector<int>> DP(K, vector<int>(T + 1)), ODP(K, vector<int>(T + 1, 0));

    for (int i = 0; i < K; i++) {
        DP[i][A[i]] = 1;
    }

    for (int m = 2; m <= N; m++) {
        for (int i = 0; i < K; i++) {
            for (int x = 0; x <= T; x++) {
                ODP[i][x] = DP[i][x];
                DP[i][x] = 0;
            }
        }

        vector<int> S(T + 1, 0);
        for (int i = 0; i < K; i++) {
            for (int x = 0; x <= T; x++) {
                S[x] += ODP[i][x];
                S[x] %= Mod;
            }
        }

        for (int i = 0; i < K; i++) {
            for (int x = 0; x <= T; x++) {
                DP[i][x] = S[x ^ A[i]] - ODP[i][x ^ A[i]];
                DP[i][x] %= Mod;
                DP[i][x] = (Mod + DP[i][x]) % Mod;

            }
        }
    }

    ll B = 0;

    Y = min(T, Y);

    for (int i = 0; i < K; i++) {
        for (int x = X; x <= Y; x++) {
            B += DP[i][x];
        }
        B %= Mod;
    }
    cout << B << endl;

}