#include "bits/stdc++.h"
#include <unordered_map>
#include <unordered_set>

#include <stdio.h>
#include <math.h>
#include <cassert>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

#include <float.h>


//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;
using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);
using pl = pair<ll, ll>;

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const ll n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;
using vm = vector<mint>;
using vvm = vector<vm>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };
template<> void ov(const vm& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << it->val(); } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };


int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, h, x;
	cin >> n >> h >> x;
	ll g, b;

	map<ll, ll> mp;
	cin >> g;
	REP(i, g) {
		ll gi;
		cin >> gi;
		mp[gi] = 1;
		REP(j, 5) {
			if (mp.find(gi - j) == mp.end() && gi - j >= 0) mp[gi - j] = 0;
			if (mp.find(gi + j) == mp.end() && gi + j <= n) mp[gi + j] = 0;
		}
	}
	cin >> b;
	REP(i, b) {
		ll bi;
		cin >> bi;
		mp[bi] = -1;
		REP(j, 5) {
			if (mp.find(bi - j) == mp.end() && bi - j >= 0) mp[bi - j] = 0;
			if (mp.find(bi + j) == mp.end() && bi + j <= n) mp[bi + j] = 0;
		}
	}

	vl init(2001, -1);


	deque<vl> dp;
	REP(i, 6) {
		dp.push_back(init);
	}
	dp[0][1000] = h;
	ll pi = -llhuge;
	REPE(e, mp) {
		ll ci = e.first;
		ll op = e.second;

		if (ci != pi + 1) {
			while (dp.size() > 1) dp.pop_back();
			REP(i, 5) {
				dp.push_back(init);
			}
		}
		pi = ci;

		REP(i, 2001) {
			if (dp[0][i] == -1) continue;
			ll nv = i + op;
			if (nv < 0 || nv > 2000) continue;

			dp[1][nv] = max(dp[1][nv], dp[0][i]);
			if (dp[0][i] >= 1 && ci + x <= n) {
				dp[x][nv] = max(dp[x][nv], dp[0][i] - 1);
			}
		}
		dp.pop_front();
		dp.push_back(init);
	}

	ll ans = -llhuge;
	REP(i, 2001) {
		if (dp[0][i] == -1) continue;
		chmax(ans, i - 1000);
	}

	cout << ans << endl;

	return 0;
}