#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
	int n, h, x; cin >> n >> h >> x;
	
	set<int> g;
	int G; cin >> G;
	for (int i=0; i<G; i++){
		int a; cin >> a;
		g.insert(a);
	}
	
	set<int> b;
	int B; cin >> B;
	for (int i=0; i<B; i++){
		int a; cin >> a;
		b.insert(a);
	}

	set<int> newb;
	newb.insert(0);
	newb.insert(n);
	for (int a: b){
		for (int i=a-x; i<=a+x; i++){
			if (0 <= i && i <= n){
				newb.insert(i);			
			}
		}
	}

	int ans_base = 0;

	for (int a: g){
		if (newb.find(a) == newb.end()){
			ans_base++;
		}
	}

	int m = newb.size();
	vector<int> score(m);
	int piv = 0;
	for (int a: newb){
		if (b.find(a) != b.end()){
			score[piv]--;
		}
		if (g.find(a) != g.end()){
			score[piv]++;
		}
		piv++;
	}

	int r = min(B, h);
	vector<vector<int>> dp(m, vector<int>(r+1, -1e9));
	dp[0][0] = 0;
	for (int i=1; i<m; i++){
		for (int j=0; j<r+1; j++){
			dp[i][j] = max(dp[i][j], dp[i-1][j] + score[i]);
			if (j >= 1 && i-x >= 0){
				dp[i][j] = max(dp[i][j], dp[i-x][j-1] + score[i]);
			}
		}
	}

	int ans = -1e9;
	for (int i=0; i<r+1; i++){
		ans = max(ans, dp[m-1][i]);
	}
	
	cout << ans + ans_base << '\n';
}