#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

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

#define rep(i, s, n) for (int i = (int)(s); i < (int)(n); i++)
#define rrep(i, s, n) for (int i = (int)(n)-1; i >= (int)(s); i--)

template <typename T> bool chmin(T &a, const T &b) {
	if (a <= b) return false;
	a = b;
	return true;
}

template <typename T> bool chmax(T &a, const T &b) {
	if (a >= b) return false;
	a = b;
	return true;
}

int dp[7][5500];

int main(){
	int n, h, x; cin >> n >> h >> x;
	vector<int> score(n+1);
	int G; cin >> G;
	rep(i,0,G){
		int g; cin >> g;
		score[g]++;
	}
	int B; cin >> B;
	rep(i,0,B){
		int b; cin >> b;
		score[b]--;
	}
	
	rep(i,0,x+1) rep(j,0,h+1) dp[i][j] = -1e9;
	dp[0][0] = 0;

	int piv = 0;
	rep(i,1,n+1){
		piv++;
		piv %= x+1;
		int prev = (piv+x)%(x+1);
		int xbak = (piv+1)%(x+1);
		dp[piv][0] = dp[prev][0] + score[i];
		rep(j,1,h+1){
			dp[piv][j] = max(dp[prev][j], dp[xbak][j-1]) + score[i];
		}
	}

	int ans = -1e9;
	rep(i,0,h+1) chmax(ans, dp[piv][i]);
	cout << ans << endl;
}