import sys
input = sys.stdin.readline

N, K, X, Y = map(int, input().split())
A = list(map(int, input().split()))
exists = [False] * 1024
for a in A:
    exists[a] = True
cnt = sum(exists)
mod = 998244353
dp = [[0] * 1024 for _ in range(N + 1)]
dp[0][0] = 1
for i in range(1, N + 1):
    for j in range(1024):
        for k in range(1024):
            if exists[k]:
                dp[i][j ^ k] += dp[i - 1][j]
    if i >= 2:
        for j in range(1024):
            dp[i][j] -= dp[i - 2][j] * (cnt - 1)
            dp[i][j] %= mod
    if i == 2:
        dp[i][0] -= 1
print(sum(dp[N][X:Y+1]) % mod)