#include <bits/stdc++.h>

const int N = 12;

int k, n, m, n0, a[N], b[N];

bool iscnt() {
    int cnt = 0;
    for (int i = 1; i < k * n; i++) {
        cnt += b[i - 1] > b[i];
    }
    return cnt == m;
}
bool isper() {
    for (int i = 0; i < k * n; i++) {
        bool has = false;
        for (int j = i - 1; j >= 0; j--) {
            if (b[j] == b[i]) { has = true; break; }
        }
        if (has) {
        for (int j = i - 1; j >= 0; j--) {
            if (b[j] == b[i]) { break; }
            if (b[j] < b[i]) { return false; }
        }
        }
    }
    return true;
}

int main() {
    scanf("%d%d%d%d", &k, &n, &m, &n0);
    for (int i = 0; i < k * n0; i++) { scanf("%d", &a[i]); }
    for (int i = 0; i < k * n; i++) { b[i] = i / k + 1; }
    int ans = 0;
    do {
        bool ok = true;
        for (int i = 0, j = 0; i < k * n; i++) {
            if (b[i] <= n0) {
                if (b[i] != a[j]) { ok = false; break; }
                j++;
            }
        }
        ans += ok && iscnt() && isper();
    } while (std::next_permutation(b, b + k * n));
    printf("%d\n", ans);
    return 0;
}