#include <bits/stdc++.h>
template <class T> using Vec = std::vector<T>;
template <class F> struct RecLambda : private F {
explicit RecLambda(F&& f): F(std::forward<F>(f)) {}
template <class... Args> decltype(auto) operator() (Args&&... args) const {
return F::operator()(*this, std::forward<Args>(args)...);
}
};
int main() {
std::ios_base::sync_with_stdio(false);
std::cin.tie(nullptr);
int N, D, T;
std::cin >> N >> D >> T;
Vec<int> A(N);
for (auto& x : A) {
std::cin >> x;
}
Vec<int> match(N);
Vec<char> done(N);
Vec<int> stack;
stack.reserve(N);
for (int i = 0; i < N; ++i) {
if (A[i] <= T) {
stack.push_back(i);
done[i] = true;
}
else {
while (!stack.empty()) {
const int j = stack.back();
if (j + (T - A[j]) >= i) {
match[i] = j;
break;
}
stack.pop_back();
}
}
}
Vec<int> gain;
gain.reserve(N);
const auto dfs = RecLambda([&](auto&& dfs, const int u) -> int {
done[u] = true;
Vec<int> path;
for (int v = u - 1; v >= match[u]; --v) {
if (!done[v]) {
path.push_back(dfs(v));
}
}
path.push_back(0);
std::sort(path.begin(), path.end());
const int ret = path.back() + 1;
path.pop_back();
std::copy(path.begin(), path.end(), std::back_inserter(gain));
return ret;
});
for (int u = N - 1; u >= 0; --u) {
if (!done[u]) {
gain.push_back(dfs(u));
}
}
std::sort(gain.rbegin(), gain.rend());
int ans = 0;
for (int i = 0; i < std::min(D, (int) gain.size()); ++i) {
ans += gain[i];
}
std::cout << N - ans << '\n';
return 0;
}
