# https://yukicoder.me/problems/no/2434

from collections import deque

MIN_VALUE = -10 ** 18

def main():
    N, H, X = map(int, input().split())
    G = int(input())
    g_list = list(map(int ,input().split()))
    B = int(input())
    b_list = list(map(int ,input().split()))

    m_set = {0, N}
    for g in g_list:
        for x in range(-X, X + 1):
            y = g + x
            if 0 <= y and y <= N:
                m_set.add(y)
    for g in b_list:
        for x in range(-X, X + 1):
            y = g + x
            if 0 <= y and y <= N:
                m_set.add(y)
    
    m_map = {s: 0 for s in m_set}
    for g in g_list:
        m_map[g] = 1
    for b in b_list:
        m_map[b] = -1


    m_array = [(s, p) for s,p in m_map.items()]
    m_array.sort(key=lambda x : x[0])

    queue = deque()
    MAX_H = B + G
    dp = [MIN_VALUE] * (min(MAX_H, H) + 1)
    dp[-1] = 0
    queue.append((0, dp))
    for i in range(1, len(m_array)):
        s, p = m_array[i]
        while len(queue) > 1 and queue[0][0] < s - X:
            queue.popleft()
        
        dp = [MIN_VALUE] * (min(MAX_H, H) + 1)

        for h in range(min(MAX_H, H) + 1):
            # 使わない
            x = queue[-1][1][h]
            dp[h] = max(dp[h], x + p)

        # 使う
        for j in range(len(queue)):
            t, q = queue[- j - 1]
            if t == s - X:
                for h in range(1, min(MAX_H, H) + 1):
                    dp[h - 1] = max(dp[h - 1], q[h] + p )
        
        queue.append((s, dp))
    
    dp = queue[-1][1]
    answer = MIN_VALUE
    for h in range(len(dp)):
        x = dp[h]
        answer = max(answer, x)
    print(answer)












if __name__ == "__main__":
    main()