#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
void exgcd(long long a, long long b, long long &d, long long &first,
           long long &second) {
  b                          ? exgcd(b, a % b, d, second, first),
      second -= a / b *first : first = 1, second = 0, d = a;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
const int N = 1e3 + 10, INF = 0x3f3f3f3f;
int a[N], b[N], n, p, k, t, r;
int dp[2][N][55][55];
void upd(int &first, int second) { first = max(first, second); }
int main() {
  scanf("%d%d%d", &n, &p, &k);
  p = min(p, (n + k - 1) / k * 2);
  scanf("%d", &r);
  for (int i = 1; i <= r; ++i) scanf("%d", &t), a[t] = 1;
  scanf("%d", &r);
  for (int i = 1; i <= r; ++i) scanf("%d", &t), b[t] = 1;
  memset(dp, -INF, sizeof dp);
  dp[0][0][0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    memset(dp[i & 1], -INF, sizeof dp[i & 1]);
    for (int j = 0; j <= p; ++j)
      for (int first = 0; first <= k - 1; ++first)
        for (int second = 0; second <= k - 1; ++second) {
          upd(dp[i & 1][j + 1][k - 1][max(second - 1, 0)],
              dp[i & 1 ^ 1][j][first][second] + (a[i] || b[i] && second));
          upd(dp[i & 1][j + 1][max(first - 1, 0)][k - 1],
              dp[i & 1 ^ 1][j][first][second] + (a[i] && first || b[i]));
          upd(dp[i & 1][j][max(first - 1, 0)][max(second - 1, 0)],
              dp[i & 1 ^ 1][j][first][second] +
                  (a[i] && first || b[i] && second));
        }
  }
  int ans = 0;
  for (int j = 0; j <= p; ++j)
    for (int first = 0; first <= k - 1; ++first)
      for (int second = 0; second <= k - 1; ++second)
        upd(ans, dp[n & 1][j][first][second]);
  printf("%d\n", ans);
}
