n, k, x, y = map(int, input().split())
a_list = list(map(int, input().split()))

x_mod = x % k
y_mod = y % k
initial_r, initial_s = sorted((x_mod, y_mod))

prev_dp = {}
prev_dp[(initial_r, initial_s)] = 0

for a in a_list:
    a_mod = a % k
    curr_dp = {}
    for (r, s), points in prev_dp.items():
        sum_mod = (r + s + a_mod) % k
        new_points = points + (1 if sum_mod == 0 else 0)
        
        # Transition 1: discard a_mod, keep r and s
        key = (r, s)
        if key in curr_dp:
            if new_points > curr_dp[key]:
                curr_dp[key] = new_points
        else:
            curr_dp[key] = new_points
        
        # Transition 2: discard s, keep r and a_mod
        new_r, new_s = sorted((r, a_mod))
        key = (new_r, new_s)
        if key in curr_dp:
            if new_points > curr_dp[key]:
                curr_dp[key] = new_points
        else:
            curr_dp[key] = new_points
        
        # Transition 3: discard r, keep s and a_mod
        new_r, new_s = sorted((s, a_mod))
        key = (new_r, new_s)
        if key in curr_dp:
            if new_points > curr_dp[key]:
                curr_dp[key] = new_points
        else:
            curr_dp[key] = new_points
    prev_dp = curr_dp

if prev_dp:
    print(max(prev_dp.values()))
else:
    print(0)