import bisect

def main():
    N, H, X = map(int, input().split())
    G = int(input())
    g = list(map(int, input().split()))
    B = int(input())
    b = list(map(int, input().split()))
    
    g.sort()
    b.sort()
    
    intervals = set()
    
    for p in g + b:
        min_a = max(1, p - (X - 2))
        max_a = min(p, N - X + 1)
        if min_a > max_a:
            continue
        for a in range(min_a, max_a + 1):
            interval_start = a
            interval_end = a + X - 2
            intervals.add((interval_start, interval_end))
    
    valid_intervals = []
    for start, end in intervals:
        g_start = bisect.bisect_left(g, start)
        g_end = bisect.bisect_right(g, end)
        g_count = g_end - g_start
        
        b_start = bisect.bisect_left(b, start)
        b_end = bisect.bisect_right(b, end)
        b_count = b_end - b_start
        
        gain = b_count - g_count
        if gain > 0:
            valid_intervals.append((start, end, gain))
    
    valid_intervals.sort(key=lambda x: (-x[2], x[1]))
    
    selected = []
    current_end = -1
    for interval in valid_intervals:
        start, end, gain = interval
        if start > current_end:
            selected.append(gain)
            current_end = end
            if len(selected) == H:
                break
    
    sum_gain = sum(selected)
    initial = G - B
    print(initial + sum_gain)

if __name__ == "__main__":
    main()