# from operator import itemgetter
# from itertools import *
# from bisect import *
from collections import *
from heapq import *
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 LI(): return list(map(int, sys.stdin.buffer.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def MI1(): return map(int1, sys.stdin.buffer.readline().split())
def LI1(): return list(map(int1, sys.stdin.buffer.readline().split()))
def LLI1(rows_number): return [LI1() for _ in range(rows_number)]
def BI(): return sys.stdin.buffer.readline().rstrip()
def SI(): return sys.stdin.buffer.readline().rstrip().decode()
def inval(ni, nj, h, w):
    if ni < 0 or ni >= h or nj < 0 or nj >= w: return True
    return False
dij = [(0, 1), (-1, 0), (0, -1), (1, 0)]
inf = 10**16
# md = 10 ** 9 + 7
md = 998244353

n, k, x, y = MI()
aa = LI()
mx = 1 << 10
aa = list(set(aa))
# dp[i][j]...i個みたあとにxorがjになるものの数
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 > 2:
            dp[i+1][j] = (sum(dp[i][j ^ a] for a in aa)-dp[i-1][j]*(len(aa)-1))%md
        elif i+1 == 2 and j == 0:
            dp[2][0] = 0
        else:
            dp[i+1][j] = sum(dp[i][j ^ a] for a in aa)%md

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