#include <bits/stdc++.h>
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
using namespace std;
const int N = 1e3 + 10, M = 52;
int dp[N][2][M][M];
int a[N];
int b[N];
int32_t main() {
  ios_base::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  int n, p, k1;
  cin >> n >> p >> k1;
  if (k1 == 0) {
    cout << 0 << endl;
    return 0;
  }
  p = min(p, 2 * ((n + k1 - 1) / k1));
  int t1;
  cin >> t1;
  for (int i = 0; i < t1; i++) {
    int x;
    cin >> x;
    a[x] = 1;
  }
  cin >> t1;
  for (int i = 0; i < t1; i++) {
    int x;
    cin >> x;
    b[x] = 1;
  }
  for (int i = 0; i < N; i++) {
    for (int j = 0; j < 2; j++) {
      for (int k = 0; k < M; k++) {
        for (int l = 0; l < M; l++) {
          dp[i][j][k][l] = -1e9;
        }
      }
    }
  }
  for (int j = 0; j <= n; j++) {
    dp[j][0][0][0] = 0;
  }
  for (int j = 0; j < n; j++) {
    for (int i = 0; i <= p; i++) {
      for (int k = 0; k <= k1; k++) {
        for (int l = 0; l <= k1; l++) {
          int x = k;
          if (x != 0) {
            x++;
            x %= k1 + 1;
          }
          int z = l;
          if (z != 0) {
            z++;
            z %= k1 + 1;
          }
          if (x > 0 && a[j + 1] == 1) {
            dp[i][1][x][z] = max(dp[i][1][x][z], dp[i][0][k][l] + 1);
          }
          if (z > 0 && b[j + 1]) {
            dp[i][1][x][z] = max(dp[i][1][x][z], dp[i][0][k][l] + 1);
          }
          dp[i][1][x][z] = max(dp[i][1][x][z], dp[i][0][k][l]);
          if (a[j + 1] > 0) {
            dp[i + 1][1][1][z] = max(dp[i + 1][1][1][z], dp[i][0][k][l] + 1);
          }
          if (b[j + 1] > 0) {
            dp[i + 1][1][x][1] = max(dp[i + 1][1][x][1], dp[i][0][k][l] + 1);
          }
        }
      }
    }
    for (int i = 0; i <= p; i++) {
      for (int k = 0; k <= k1; k++) {
        for (int l = 0; l <= k1; l++) {
          dp[i][0][k][l] = dp[i][1][k][l];
          dp[i][1][k][l] = -1e9;
        }
      }
    }
  }
  int ans = 0;
  for (int y = 0; y <= p; y++)
    for (int i = 0; i <= k1; i++) {
      for (int j = 0; j <= k1; j++) {
        ans = max(ans, dp[y][0][i][j]);
      }
    }
  cout << ans;
}
