#include<bits/stdc++.h>
using namespace std;
using ll = long long;
#define all(p) p.begin(),p.end()
#define rep(i,a,b) for(int i=(int)a;i<(int)b;i++)

int main(){
	int N,H,X;
	cin>>N>>H>>X;
	set<int> s;
	auto f=[&]()->vector<int>{
		int n;
		cin>>n;
		vector<int> p(n);
		rep(i,0,n){
			cin>>p[i];
			rep(k,1,X) if(p[i]-k>=0&&p[i]-k+X<=N) s.insert(p[i]-k);
		}
		return p;
	};
	auto p=f(),q=f();
	H=min(H,(int)p.size()+(int)q.size());
	vector<int> order;
	for(auto x:s) order.push_back(x);
	int L=order.size();
	vector dp(L+1,vector<int>(H+1));
	rep(i,0,L){
		int val=0;
		int to=i;
		while(to!=L&&order[i]+X>order[to]) to++;
		for(auto x:p) if(order[i]<x&&x<order[i]+X) val--;
		for(auto x:q) if(order[i]<x&&x<order[i]+X) val++;
		rep(j,0,H){
			dp[to][j+1]=max(dp[to][j+1],dp[i][j]+val);
		}
		rep(j,0,H+1){
			dp[i+1][j]=max(dp[i+1][j],dp[i][j]);
		}
	}
	int ans=dp[L][H];
	ans+=(int)p.size();
	ans-=(int)q.size();
	cout<<ans<<"\n";
}