#include <bits/stdc++.h>
using namespace std;
int n, p, k;
bool bz1[1005], bz2[1005];
int f[2][1005][55][55];
int ans;
int main() {
  scanf("%d%d%d", &n, &p, &k);
  int cnt1;
  scanf("%d", &cnt1);
  for (int i = 1; i <= cnt1; i++) {
    int x;
    scanf("%d", &x);
    bz1[x] = 1;
  }
  int cnt2;
  scanf("%d", &cnt2);
  for (int i = 1; i <= cnt2; i++) {
    int x;
    scanf("%d", &x);
    bz2[x] = 1;
  }
  if (2 * (n / k + (n % k != 0)) <= p) {
    int tot = 0;
    for (int i = 1; i <= n; i++)
      if (bz1[i] || bz2[i]) tot++;
    printf("%d", tot);
    return 0;
  }
  int now = 0, las = 1;
  memset(f, 200, sizeof(f));
  f[now][0][0][0] = 0;
  for (int i = 0; i <= n - 1; i++) {
    swap(now, las);
    memset(f[now], 200, sizeof(f[now]));
    for (int j = 0; j <= p; j++)
      for (int p1 = 0; p1 <= k; p1++)
        for (int p2 = 0; p2 <= k; p2++) {
          if (f[las][j][p1][p2] < 0) continue;
          ans = max(ans, f[las][j][p1][p2]);
          for (int b1 = 0; b1 <= 1; b1++)
            for (int b2 = 0; b2 <= 1; b2++) {
              if (j + b1 + b2 > p) continue;
              int np = j + b1 + b2;
              int np1 = p1;
              int np2 = p2;
              if (b1) np1 = k;
              if (b2) np2 = k;
              if (np1 > 0 && bz1[i + 1])
                f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)] =
                    max(f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)],
                        f[las][j][p1][p2] + 1);
              if (np2 > 0 && bz2[i + 1])
                f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)] =
                    max(f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)],
                        f[las][j][p1][p2] + 1);
              f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)] =
                  max(f[now][np][max(np1 - 1, 0)][max(np2 - 1, 0)],
                      f[las][j][p1][p2]);
            }
        }
  }
  for (int j = 0; j <= p; j++)
    for (int p1 = 0; p1 <= k; p1++)
      for (int p2 = 0; p2 <= k; p2++) ans = max(ans, f[now][j][p1][p2]);
  printf("%d", ans);
  return 0;
}
