#include<bits/stdc++.h>
#define rep(i, s, f) for(ll i = s; i <= f; i++)
typedef int ll;
using namespace std;

void solve() {
   ll N, H, X;
  cin >> N >> H >> X;
  ll G, B;
  cin >> G;
  vector<ll> g(G+1);
  for(int i = 1; i <= G; i++) {
    cin >> g.at(i);
   
  }
  cin >> B;
  vector<ll> b(B+1);
  for(int i = 1; i <= B; i++) {
    cin >> b.at(i);
  }
  H = min(200, H);

  vector<ll> table(N+1, 0);
  rep(i, 1, G){
    table.at(g.at(i)) = 1;
  }
  rep(i, 1, B) {
    table.at(b.at(i)) = -1;
  }

  vector<vector<ll>> dp(N+1, vector<ll>(H+1, -100100100));
  dp.at(0).at(H) = 0;
  rep(i, 1, N) {
    rep(j, 0, H) {
      dp[i][j] = max(dp[i-1][j] + table[i], dp[i][j]);
      if(j != H && i >= X) dp[i][j] = max(dp[i][j], dp[i-X][j+1] + table[i]);
    }
  }

  ll ans = -100100100;
  rep(i, 0, H) {
    ans = max(ans, dp.at(N).at(i));
  }
  cout << ans << endl;

}
//stringでの数字の下から1桁目は 正:S.at(N-1)  誤:S.at(0)
//if(S.at(i) == 1　← charなのに1...?
// modは取りましたか...?(´・ω・｀)



int main() {
  ios::sync_with_stdio(false);
  std::cin.tie(nullptr);
  cout << fixed << setprecision(15);
  solve();
  return 0;
}