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

//* ATCODER
#include<atcoder/all>
using namespace atcoder;
typedef modint998244353 mint;
//*/

/* BOOST MULTIPRECISION
#include<boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
//*/

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;
}

template <typename T> T max(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmax(ret, a[i]);
	return ret;
}

template <typename T> T min(vector<T> &a){
	assert(!a.empty());
	T ret = a[0];
	for (int i=0; i<(int)a.size(); i++) chmin(ret, a[i]);
	return ret;
}

template <typename T> T sum(vector<T> &a){
	T ret = 0;
	for (int i=0; i<(int)a.size(); i++) ret += a[i];
	return ret;
}

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;
		g--;
		score[g]++;
	}
	int B; cin >> B;
	rep(i,0,B){
		int b; cin >> b;
		b--;
		score[b]--;
	}
	vector<vector<int>> dp(n+1, vector<int>(0));
	dp[0] = vector<int>(n, -1e9);
	dp[0][0] = 0;
	rep(i,1,n+1){
		dp[i] = dp[i-1];
		rep(j,0,h+1) dp[i][j] += score[i];
		rep(j,1,h+1){
			if (i-x >= 0){
				chmax(dp[i][j], dp[i-x][j-1] + score[i]);
			}
		}
		if (i-x >= 0) vector<int>().swap(dp[i-x]);
	}
	cout << max(dp[n]) << endl;
}