/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.12.01 07:58:21
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

template< int MOD >
struct mint {
public:
    long long x;
    mint(long long x = 0) :x((x%MOD+MOD)%MOD) {}
    mint(std::string &s) {
        long long z = 0;
        for (int i = 0; i < s.size(); i++) {
            z *= 10;
            z += s[i] - '0';
            z %= MOD;
        }
        this->x = z;
    }
    mint& operator+=(const mint &a) {
        if ((x += a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator-=(const mint &a) {
        if ((x += MOD - a.x) >= MOD) x -= MOD;
        return *this;
    }
    mint& operator*=(const mint &a) {
        (x *= a.x) %= MOD;
        return *this;
    }
    mint& operator/=(const mint &a) {
        long long n = MOD - 2;
        mint u = 1, b = a;
        while (n > 0) {
            if (n & 1) {
                u *= b;
            }
            b *= b;
            n >>= 1;
        }
        return *this *= u;
    }
    mint operator+(const mint &a) const {
        mint res(*this);
        return res += a;
    }
    mint operator-() const {return mint() -= *this; }
    mint operator-(const mint &a) const {
        mint res(*this);
        return res -= a;
    }
    mint operator*(const mint &a) const {
        mint res(*this);
        return res *= a;
    }
    mint operator/(const mint &a) const {
        mint res(*this);
        return res /= a;
    }
    friend std::ostream& operator<<(std::ostream &os, const mint &n) {
        return os << n.x;
    }
    friend std::istream &operator>>(std::istream &is, mint &n) {
        long long x;
        is >> x;
        n = mint(x);
        return is;
    }
    bool operator==(const mint &a) const {
        return this->x == a.x;
    }
    bool operator!=(const mint &a) const {
        return this->x != a.x;
    }
    mint pow(long long k) const {
        mint ret = 1;
        mint p = this->x;
        while (k > 0) {
            if (k & 1) {
                ret *= p;
            }
            p *= p;
            k >>= 1;
        }
        return ret;
    }
};
constexpr int MOD = 998244353;
int main() {
    int n,k,x,y;cin >> n >> k >> x >> y;
    vector<int> a(k);
    vector<bool> b(1024,false);
    vector<int> c;
    for (int i = 0; i < k; i++) {
        cin >> a[i];
        if (!b[a[i]]) c.push_back(a[i]);
        b[a[i]] = true;
    }
    sort(c.begin(), c.end());
    vector<vector<vector<mint<MOD>>>> dp(n,vector<vector<mint<MOD>>>(1024,vector<mint<MOD>>(1024)));
    for (int i = 0; i < 1024; i++) {
        if (b[i]) dp[0][i][i] = 1;
    }
    for (int i = 1; i < n; i++) {
        vector<mint<MOD>> sum(1024,0);
        for (int s = 0; s < 1024; s++) {
            for (int j = 0; j < c.size(); j++) {
                sum[s] += dp[i-1][s][c[j]];
            }
        }
        for (int s = 0; s < 1024; s++) {
            for (int j = 0; j < c.size(); j++) {
                dp[i][s][c[j]] = sum[s^c[j]] - dp[i-1][s^c[j]][c[j]];
                
                
                
                
            }
        }
    }
    y = min(1023,y);
    x = max(min(1023,x),0);
    mint<MOD> ans = 0;
    for (int i = 0; i < 1024; i++) {
        for (int j = x; j <= y; j++) {
            ans += dp[n-1][j][i];
        }
    }
    cout << ans << endl;
    return 0;
}