#ifndef LOCAL
#define FAST_IO
#endif

// ============
#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <cmath>
#include <iomanip>
#include <iostream>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <tuple>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

#define OVERRIDE(a, b, c, d, ...) d
#define REP2(i, n) for (i32 i = 0; i < (i32)(n); ++i)
#define REP3(i, m, n) for (i32 i = (i32)(m); i < (i32)(n); ++i)
#define REP(...) OVERRIDE(__VA_ARGS__, REP3, REP2)(__VA_ARGS__)
#define PER(i, n) for (i32 i = (i32)(n) - 1; i >= 0; --i)
#define ALL(x) begin(x), end(x)

using namespace std;

using u32 = unsigned int;
using u64 = unsigned long long;
using i32 = signed int;
using i64 = signed long long;
using f64 = double;
using f80 = long double;

template <typename T>
using Vec = vector<T>;

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

#ifdef INT128

using u128 = __uint128_t;
using i128 = __int128_t;

istream &operator>>(istream &is, i128 &x) {
    i64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, i128 x) {
    os << (i64)x;
    return os;
}
istream &operator>>(istream &is, u128 &x) {
    u64 v;
    is >> v;
    x = v;
    return is;
}
ostream &operator<<(ostream &os, u128 x) {
    os << (u64)x;
    return os;
}

#endif

[[maybe_unused]] constexpr i32 INF = 1000000100;
[[maybe_unused]] constexpr i64 INF64 = 3000000000000000100;
struct SetUpIO {
    SetUpIO() {
#ifdef FAST_IO
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
#endif
        cout << fixed << setprecision(15);
    }
} set_up_io;
// ============

#ifdef DEBUGF
#else
#define DBG(x) (void)0
#endif

int main() {
    i32 n, h, x;
    cin >> n >> h >> x;
    i32 g;
    cin >> g;
    Vec<i32> gp(g);
    REP(i, g) {
        cin >> gp[i];
    }
    i32 b;
    cin >> b;
    Vec<i32> bp(b);
    REP(i, b) {
        cin >> bp[i];
    }
    Vec<i32> pos;
    pos.reserve((2 * x - 1) * (g + b) + 2);
    for (i32 ele : gp) {
        REP(d, -x + 1, x) {
            if (0 <= ele + d && ele + d <= n) {
                pos.push_back(ele + d);
            }
        }
    }
    for (i32 ele : bp) {
        REP(d, -x + 1, x) {
            pos.push_back(ele + d);
        }
    }
    pos.push_back(0);
    pos.push_back(n);
    sort(ALL(pos));
    pos.erase(unique(ALL(pos)), pos.end());
    Vec<i32> val(pos.size(), 0);
    for (i32 ele : gp) {
        i32 idx = (i32)(lower_bound(ALL(pos), ele) - pos.begin());
        val[idx] = 1;
    }
    for (i32 ele : bp) {
        i32 idx = (i32)(lower_bound(ALL(pos), ele) - pos.begin());
        val[idx] = -1;
    }
    DBG(pos);
    DBG(val);
    chmin(h, g + b);
    Vec<Vec<i32>> dp(h + 1, Vec<i32>(val.size(), -INF));
    dp[0][0] = 0;
    REP(i, val.size() - 1) REP(j, h + 1) {
        chmax(dp[j][i + 1], dp[j][i] + val[i + 1]);
        if (j != h) {
            i32 idx = (i32)(lower_bound(ALL(pos), pos[i] + x) - pos.begin());
            if (idx != (i32)pos.size() && pos[idx] == pos[i] + x) {
                chmax(dp[j + 1][idx], dp[j][i] + val[idx]);
            }
        }
    }
    DBG(dp);
    i32 ans = -INF;
    REP(i, h + 1) {
        chmax(ans, dp[i].back());
    }
    cout << ans << '\n';
}