#include <bits/stdc++.h>
using namespace std;
const int maxn = 1e3 + 7;
const int Inf = 1e9 + 7;
int f[2][maxn][55][55], n, a[maxn], b[maxn], p, times, len;
int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cin >> n >> times >> len;
  times = min(times, 2 * (n / len + 1));
  if (times == 0) return cout << 0, 0;
  int gau, meo;
  cin >> gau;
  while (gau--) {
    cin >> meo;
    a[meo] = 1;
  }
  cin >> gau;
  while (gau--) {
    cin >> meo;
    b[meo] = 1;
  }
  fill_n(&f[0][0][0][0], 2 * maxn * 55 * 55, -Inf);
  f[0][0][0][0] = 0;
  for (int i = 1; i <= n; i++) {
    int cur = i & 1;
    int pre = 1 - cur;
    for (int j = 1; j <= times; j++) {
      f[cur][j][len - 1][0] =
          max(f[cur][j][len - 1][0], f[pre][j - 1][0][0] + a[i]);
      f[cur][j][0][len - 1] =
          max(f[cur][j][0][len - 1], f[pre][j - 1][0][0] + b[i]);
      for (int k = 0; k < len - 1; k++) {
        f[cur][j][k][0] = max(f[cur][j][k][0], f[pre][j][k + 1][0] + a[i]);
        f[cur][j][0][k] = max(f[cur][j][0][k], f[pre][j][0][k + 1] + b[i]);
      }
    }
    for (int j = 1; j <= times; j++) {
      for (int k = 0; k < len - 1; k++) {
        f[cur][j][len - 1][k] =
            max(f[cur][j][len - 1][k], f[pre][j - 1][0][k + 1] + (a[i] | b[i]));
        f[cur][j][k][len - 1] =
            max(f[cur][j][k][len - 1], f[pre][j - 1][k + 1][0] + (a[i] | b[i]));
        if (j >= 2)
          for (int t = 0; t < len - 1; t++) {
            f[cur][j][k][t] =
                max(f[cur][j][k][t], f[pre][j][k + 1][t + 1] + (a[i] | b[i]));
          }
      }
    }
    for (int j = 0; j <= times; j++) {
      f[cur][j][0][0] = max(f[cur][j][0][0], f[pre][j][0][0]);
    }
    for (int j = 0; j <= times; j++) {
      for (int k = 0; k < len; k++) {
        for (int t = 0; t < len; t++) {
          f[pre][j][k][t] = -Inf;
        }
      }
    }
  }
  int ans = 0;
  for (int i = 1; i <= times; i++) {
    for (int j = 0; j < len; j++) {
      for (int k = 0; k < len; k++) {
        ans = max(ans, f[n & 1][i][j][k]);
      }
    }
  }
  cout << ans;
}
