#include <bits/stdc++.h>
using namespace std;

const int K_MAX = 100000;

int main() {
  int guides, k, m, c;
  cin >> guides >> k >> m >> c;

  vector<int> requests(K_MAX + 1, 0);
  for (int i = 0; i < c; i++) {
    int s;
    cin >> s;
    requests[s] += 1;
    if (s > k - m + 1) return 1 / 0;
  }

  vector<int> guide_ends(K_MAX + 1, 0);
  int total = 0;

  for (int s = 1; s <= K_MAX - m + 1; s++) {
    int accepted = min(guides, requests[s]);
    total += accepted;
    guides -= accepted;
    guide_ends[s + m - 1] += accepted;
    guides += guide_ends[s];
  }
  cout << total;
}