import sys
input = lambda :sys.stdin.readline()[:-1]
ni = lambda :int(input())
na = lambda :list(map(int,input().split()))
yes = lambda :print("yes");Yes = lambda :print("Yes");YES = lambda : print("YES")
no = lambda :print("no");No = lambda :print("No");NO = lambda : print("NO")
#######################################################################
inf = float("inf")
n,h,x = na()
G = ni()
g = na()
B = ni()
b = na()
h = min(h, B)
from collections import defaultdict

f = defaultdict(int)
for i in range(G):
    f[g[i]] = 1

for i in range(B):
    f[b[i]] = 2
    for j in range(1, x+1):
        if b[i] + j <= n and f[b[i] + j] == 0:
            f[b[i]+j]  = 0

f[0] = 0
if f[n] == 0:f[n] = 0
s = sorted(f)
d = {x:i for i, x in enumerate(s)}
m = len(s)

dp = [[-inf]*(h + 1) for i in range(m)]
dp[0][h] = 0
from bisect import bisect_right as br
for i in range(1, m):
    y = s[i]
    if f[y] == 1:
        dif = 1
    elif f[y] == 2:
        dif = -1
    else:
        dif = 0
    
    if y - x >= 0:
        z = br(s, y-x)-1
        for j in range(h):
            dp[i][j] = max(dp[i][j], dp[z][j+1]+dif)
    if y - 1 >= 0:
        z = br(s, y-1)-1
        for j in range(h+1):
            dp[i][j] = max(dp[i][j], dp[z][j]+dif)
    #print(y, dp[i])

print(max(dp[-1]))