mod = 998244353

n, K, X, Y = map(int, input().split())
A = list(map(int, input().split()))

from collections import defaultdict

prev = defaultdict(int)
for a in A:
    prev[(a, a)] += 1

for _ in range(n - 1):
    curr = defaultdict(int)
    for (last, xor_sum), cnt in prev.items():
        for a in A:
            if a != last:
                new_xor = xor_sum ^ a
                curr[(a, new_xor)] = (curr[(a, new_xor)] + cnt) % mod
    prev = curr

result = 0
for (last, xor_val) in prev:
    if X <= xor_val <= Y:
        result = (result + prev[(last, xor_val)]) % mod

print(result)