#include <bits/stdc++.h>
using namespace std;
int main() {
    int n,k,m,c; cin >> n >> k >> m >> c;
    vector<pair<int,int>> a(k+1);
    for (int i = 0; i < c; i++) {
        int x; cin >> x;
        a[x].first += 1;
    }
    int out = 0;
    for (int i = 1; i <= k; i++) {
        n += a[i].second;
        if (a[i].first >= 1 && n > 0) {
            out += min(a[i].first,n);
            a[i+m-1].second = min(a[i].first,n);
            n -= min(a[i].first,n);
        }
    }
    cout << out;
}