#include #include #include #include #include #include #include #include #include static const int MOD = 998244353; using ll = long long; using u32 = unsigned; using u64 = unsigned long long; using namespace std; template constexpr T INF = ::numeric_limits::max() / 32 * 15 + 208; template struct modint { u32 val; public: static modint raw(int v) { modint x; x.val = v; return x; } modint() : val(0) {} template modint(T v) { ll x = (ll)(v%(ll)(M)); if (x < 0) x += M; val = u32(x); } modint(bool v) { val = ((unsigned int)(v) % M); } modint& operator++() { val++; if (val == M) val = 0; return *this; } modint& operator--() { if (val == 0) val = M; val--; return *this; } modint operator++(int) { modint result = *this; ++*this; return result; } modint operator--(int) { modint result = *this; --*this; return result; } modint& operator+=(const modint& b) { val += b.val; if (val >= M) val -= M; return *this; } modint& operator-=(const modint& b) { val -= b.val; if (val >= M) val += M; return *this; } modint& operator*=(const modint& b) { u64 z = val; z *= b.val; val = (u32)(z % M); return *this; } modint& operator/=(const modint& b) { return *this = *this * b.inv(); } modint operator+() const { return *this; } modint operator-() const { return modint() - *this; } modint pow(long long n) const { modint x = *this, r = 1; while (n) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } modint inv() const { return pow(M-2); } friend modint operator+(const modint& a, const modint& b) { return modint(a) += b; } friend modint operator-(const modint& a, const modint& b) { return modint(a) -= b; } friend modint operator*(const modint& a, const modint& b) { return modint(a) *= b; } friend modint operator/(const modint& a, const modint& b) { return modint(a) /= b; } friend bool operator==(const modint& a, const modint& b) { return a.val == b.val; } friend bool operator!=(const modint& a, const modint& b) { return a.val != b.val; } }; using mint = modint; template void fwht(vector &v){ int sz = 1; while(sz < v.size()) sz <<= 1; v.resize(sz); for (int i = 1; i < sz; i <<= 1) { for (int j = 0; j < sz; j += (i<<1)) { for (int k = 0; k < i; ++k) { T x = v[j+k], y = v[j+k+i]; v[j+k] = (x+y), v[j+k+i] = (x-y); } } } } template void ifwht(vector &v){ int sz = 1; while(sz < v.size()) sz <<= 1; v.resize(sz); for (int i = 1; i < sz; i <<= 1) { for (int j = 0; j < sz; j += (i<<1)) { for (int k = 0; k < i; ++k) { T x = v[j+k], y = v[j+k+i]; v[j+k] = (x+y)*499122177, v[j+k+i] = (x-y)*499122177; } } } } int main() { int n, k, x, y; scanf("%d %d %d %d", &n, &k, &x, &y); vector bs(k); for (auto &&i : bs) scanf("%d", &i); sort(bs.begin(), bs.end()); bs.erase(unique(bs.begin(), bs.end()), bs.end()); k = bs.size(); vector a(1024); for (int i = 0; i < k; ++i) a[bs[i]] = 1; fwht(a); vector> dp(n+1, vector(1024)); dp[0][0] = 1; fwht(dp[0]); for (int i = 1; i <= n; ++i) { dp[i] = dp[i-1]; for (int j = 0; j < 1024; ++j) dp[i][j] *= a[j]; if(i >= 2) for (int j = 0; j < 1024; ++j) dp[i][j] -= dp[i-2][j]*k; if(i >= 3) for (int j = 0; j < 1024; ++j) dp[i][j] += dp[i-2][j]; } ifwht(dp.back()); mint ans = 0; for (int i = x; i <= min(y, 1023); ++i) { ans += dp.back()[i]; } printf("%d\n", ans.val); return 0; }