import sys

sys.setrecursionlimit(10**6)
int1 = lambda x: int(x)-1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.buffer.readline())
def MI(): return map(int, sys.stdin.buffer.readline().split())
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
# dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
dij = [[(-1, 0), (1, 0)], [(0, -1), (0, 1)]]
inf = 10**16
md = 998244353
# md = 10**9+7

mx = 1024
n, k, x, y = MI()
aa = LI()
dp = [[0]*mx for _ in range(n+1)]
dp[0][0] = 1

for i in range(n):
    for j in range(mx):
        if i == 1 and j == 0: continue
        if i: dp[i+1][j] -= dp[i-1][j]*(k-1)
        for a in aa:
            dp[i+1][j] += dp[i][j ^ a]
        dp[i+1][j] %= md
# p2D(dp)

ans = sum(dp[-1][j] for j in range(x, y+1))%md
print(ans)