#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

int getIndex(vector<int> v, int X) {
    auto it = find(v.begin(), v.end(), X);
    if (it != v.end()) {
        int index = it - v.begin();
        return index;
    }
    else {
        return -1;
    }
}



int main() {
    /*  2 10 4 6
        1 2 2 5 6 7
    */

    int N, K, M, C, a=0;

    cin >> N >> K >> M >> C;
    vector<int> igenyek(C);
    vector<int> kiserok(N, -1);

    for (int i = 0; i < C; i++) {
        cin >> igenyek[i];
    }

    for(int i=0; i<C; i++) {


        int idegenvezeto = getIndex(kiserok, -1);
        if (idegenvezeto != -1) {
            kiserok[idegenvezeto] = igenyek[i]+M-1;
            a++;
        }
        for (int j = 0; j < N; j++) {
            if(kiserok[j] < igenyek[i]) {
                kiserok[j] = igenyek[i] + M - 1;
                a++;
                break;
            }
        }
         

            
        
        
        

    }


    cout << a << endl;



    return 0;
}