#include <bits/stdc++.h>
using namespace std;
const int N = 1060, M = 51;
int n, p, k;
int a[N], b[N], com[N], dp[2][N][M][M];
int main() {
  cin >> n >> p >> k;
  int np, i, j, y, r, x, u, v, z, T = 0;
  cin >> r;
  for (i = 0; i < r; ++i) scanf("%d", &x), a[x] = 1, ++T;
  cin >> r;
  for (i = 0; i < r; ++i) scanf("%d", &x), b[x] = 1, ++T;
  for (i = 1; i <= n; ++i)
    if (a[i] && b[i]) com[i] = 1, --T;
  if (p * k >= 2 * n) {
    cout << T << endl;
    return 0;
  }
  int ret = 0, pos = 0, c;
  for (j = 0; j <= p; ++j)
    for (x = 0; x < k; ++x)
      for (y = 0; y < k; ++y) dp[pos][j][x][y] = -1e9;
  dp[pos][0][0][0] = 0;
  for (i = 1; i <= n + 1; ++i) {
    for (j = 0; j <= p; ++j)
      for (x = 0; x < k; ++x)
        for (y = 0; y < k; ++y) dp[pos ^ 1][j][x][y] = -1e9;
    for (j = 0; j <= p; ++j)
      for (x = 0; x < k; ++x)
        for (y = 0; y < k; ++y) {
          c = 0;
          ret = max(ret, dp[pos][j][x][y]);
          np = pos ^ 1, u = (x + 1) % k, v = (y + 1) % k;
          if (x > 0 && y == 0) {
            dp[np][j][u][y] = max(dp[np][j][u][y], dp[pos][j][x][y] + a[i]);
            dp[np][j + 1][u][v] = max(dp[np][j + 1][u][v],
                                      dp[pos][j][x][y] + a[i] + b[i] - com[i]);
          }
          if (y > 0 && x == 0) {
            dp[np][j][x][v] = max(dp[np][j][x][v], dp[pos][j][x][y] + b[i]);
            dp[np][j + 1][u][v] = max(dp[np][j + 1][u][v],
                                      dp[pos][j][x][y] + a[i] + b[i] - com[i]);
          }
          if (x == 0 && y == 0) {
            dp[np][j + 1][x][v] =
                max(dp[np][j + 1][x][v], dp[pos][j][x][y] + b[i]),
                       dp[np][j + 1][u][y] =
                           max(dp[np][j + 1][u][y], dp[pos][j][x][y] + a[i]),
                       dp[np][j + 2][u][v] =
                           max(dp[np][j + 2][u][v],
                               dp[pos][j][x][y] + a[i] + b[i] - com[i]),
                       dp[np][j][0][0] = max(dp[np][j][0][0], dp[pos][j][x][y]);
          }
          if (x > 0 && y > 0) {
            dp[np][j][u][v] =
                max(dp[np][j][u][v], dp[pos][j][x][y] + a[i] + b[i] - com[i]);
          }
        }
    pos ^= 1;
  }
  cout << ret << endl;
}
