//Sylwia Sapkowska
#include <bits/stdc++.h>
#pragma GCC optimize("O3", "unroll-loops")
using namespace std;
void __print(int x) {cerr << x;}
void __print(long long x) {cerr << x;}
void __print(long double x) {cerr << x;}
void __print(char x) {cerr << '\'' << x << '\'';}
void __print(const char *x) {cerr << '\"' << x << '\"';}
void __print(const string &x) {cerr << '\"' << x << '\"';}
void __print(bool x) {cerr << (x ? "true" : "false");}
template<typename T, typename V>
void __print(const pair<T, V> &x) {cerr << '{'; __print(x.first); cerr << ", "; __print(x.second); cerr << '}';}
template<typename T>
void __print(const T &x) {int f = 0; cerr << '{'; for (auto &i: x) cerr << (f++ ? ", " : ""), __print(i); cerr << "}";}
void _print() {cerr << "]\n";}
template <typename T, typename... V>
void _print(T t, V... v) {__print(t); if (sizeof...(v)) cerr << ", "; _print(v...);}
#ifdef LOCAL
#define debug(x...) cerr << "[" << #x << "] = ["; _print(x)
#else
#define debug(x...)
#endif
typedef pair<int, int> T;
const int oo = 1e9+7;
struct TreeMin{
vector<T>tab;
int size = 1;
TreeMin(int n, vector<int>&a){
while (size < n) size*=2;
tab.assign(2*size, {oo, oo});
for (int i = 1; i<(int)a.size(); i++) tab[i+size] = {a[i], i};
for (int i = size-1; i>=1; i--) tab[i] = min(tab[2*i], tab[2*i+1]);
}
T query(int l, int r){
T ans = {oo, oo};
for (l += size-1, r += size+1; r-l>1; l/=2, r/=2){
if (!(l&1)) ans = min(ans, tab[l+1]);
if (r&1) ans = min(ans, tab[r-1]);
}
return ans;
}
void update(int x) {
x += size;
tab[x] = {oo, oo};
while (x){
x/=2;
tab[x] = min(tab[2*x], tab[2*x+1]);
}
}
};
struct Tree{
vector<int>tab, lazy;
int size = 1;
Tree(int n){
while (size < n) size*=2;
tab.assign(2*size, 0);
lazy.assign(2*size, 0);
}
void update(int x, int lx, int rx, int l, int r, int v){
if (lx != rx) push(x);
if (lx > r || rx < l) return;
if (lx >= l && rx <= r) {
tab[x] += v;
lazy[x] += v;
return;
}
int m = (lx+rx)/2;
update(2*x, lx, m, l, r, v);
update(2*x+1, m+1, rx, l, r, v);
tab[x] = max(tab[2*x], tab[2*x+1]);
}
void push(int x){
if (!lazy[x]) return;
tab[2*x] += lazy[x];
tab[2*x+1] += lazy[x];
lazy[2*x] += lazy[x];
lazy[2*x+1] += lazy[x];
lazy[x] = 0;
}
int find(int x, int lx, int rx){
if (lx == rx) return lx;
push(x);
int m = (lx+rx)/2;
if (tab[2*x] < tab[2*x+1]) return find(2*x+1, m+1, rx);
return find(2*x, lx, m);
}
};
void read(int &x){
register int c;
x = 0;
c = getchar_unlocked();
for (;(c>47 && c<58);c=getchar_unlocked()) x = x*10 + c - 48;
}
struct IOPre {
static constexpr int TEN = 10, SZ = TEN * TEN * TEN * TEN;
std::array<char, 4 * SZ> num;
constexpr IOPre() : num{} {
for (int i = 0; i < SZ; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i * 4 + j] = static_cast<char>(n % TEN + '0');
n /= TEN;
}
}
}
};
struct IO {
#if !HAVE_DECL_FREAD_UNLOCKED
#define fread_unlocked fread
#endif
#if !HAVE_DECL_FWRITE_UNLOCKED
#define fwrite_unlocked fwrite
#endif
static constexpr int SZ = 1 << 17, LEN = 32, TEN = 10, HUNDRED = TEN * TEN,
THOUSAND = HUNDRED * TEN, TENTHOUSAND = THOUSAND * TEN,
MAGIC_MULTIPLY = 205, MAGIC_SHIFT = 11, MASK = 15,
TWELVE = 12, SIXTEEN = 16;
static constexpr IOPre io_pre = {};
std::array<char, SZ> input_buffer, output_buffer;
int input_ptr_left, input_ptr_right, output_ptr_right;
IO()
: input_buffer{},
output_buffer{},
input_ptr_left{},
input_ptr_right{},
output_ptr_right{} {}
IO(const IO&) = delete;
IO(IO&&) = delete;
IO& operator=(const IO&) = delete;
IO& operator=(IO&&) = delete;
~IO() { flush(); }
template <class T>
struct is_char {
static constexpr bool value = std::is_same_v<T, char>;
};
template <class T>
struct is_bool {
static constexpr bool value = std::is_same_v<T, bool>;
};
template <class T>
struct is_string {
static constexpr bool value =
std::is_same_v<T, std::string> || std::is_same_v<T, const char*> ||
std::is_same_v<T, char*> || std::is_same_v<std::decay_t<T>, char*>;
;
};
template <class T, class D = void>
struct is_custom {
static constexpr bool value = false;
};
template <class T>
struct is_custom<T, std::void_t<typename T::internal_value_type>> {
static constexpr bool value = true;
};
template <class T>
struct is_default {
static constexpr bool value = is_char<T>::value || is_bool<T>::value ||
is_string<T>::value ||
std::is_integral_v<T>;
};
template <class T, class D = void>
struct is_iterable {
static constexpr bool value = false;
};
template <class T>
struct is_iterable<
T, typename std::void_t<decltype(std::begin(std::declval<T>()))>> {
static constexpr bool value = true;
};
template <class T, class D = void, class E = void>
struct is_applyable {
static constexpr bool value = false;
};
template <class T>
struct is_applyable<T, std::void_t<typename std::tuple_size<T>::type>,
std::void_t<decltype(std::get<0>(std::declval<T>()))>> {
static constexpr bool value = true;
};
template <class T>
static constexpr bool needs_newline = (is_iterable<T>::value ||
is_applyable<T>::value) &&
(!is_default<T>::value);
template <typename T, typename U>
struct any_needs_newline {
static constexpr bool value = false;
};
template <typename T>
struct any_needs_newline<T, std::index_sequence<>> {
static constexpr bool value = false;
};
template <typename T, std::size_t I, std::size_t... Is>
struct any_needs_newline<T, std::index_sequence<I, Is...>> {
static constexpr bool value =
needs_newline<decltype(std::get<I>(std::declval<T>()))> ||
any_needs_newline<T, std::index_sequence<Is...>>::value;
};
inline void load() {
memmove(std::begin(input_buffer),
std::begin(input_buffer) + input_ptr_left,
input_ptr_right - input_ptr_left);
input_ptr_right =
input_ptr_right - input_ptr_left +
static_cast<int>(fread_unlocked(
std::begin(input_buffer) + input_ptr_right - input_ptr_left, 1,
SZ - input_ptr_right + input_ptr_left, stdin));
input_ptr_left = 0;
}
inline void read_char(char& c) {
if (input_ptr_left + LEN > input_ptr_right) load();
c = input_buffer[input_ptr_left++];
}
inline void read_string(std::string& x) {
char c;
while (read_char(c), c < '!') continue;
x = c;
while (read_char(c), c >= '!') x += c;
}
template <class T>
inline std::enable_if_t<std::is_integral_v<T>, void> read_int(T& x) {
if (input_ptr_left + LEN > input_ptr_right) load();
char c = 0;
do c = input_buffer[input_ptr_left++];
while (c < '-');
[[maybe_unused]] bool minus = false;
if constexpr (std::is_signed<T>::value == true)
if (c == '-') minus = true, c = input_buffer[input_ptr_left++];
x = 0;
while (c >= '0')
x = x * TEN + (c & MASK), c = input_buffer[input_ptr_left++];
if constexpr (std::is_signed<T>::value == true)
if (minus) x = -x;
}
inline void skip_space() {
if (input_ptr_left + LEN > input_ptr_right) load();
while (input_buffer[input_ptr_left] <= ' ') input_ptr_left++;
}
inline void flush() {
fwrite_unlocked(std::begin(output_buffer), 1, output_ptr_right, stdout);
output_ptr_right = 0;
}
inline void write_char(char c) {
if (output_ptr_right > SZ - LEN) flush();
output_buffer[output_ptr_right++] = c;
}
inline void write_bool(bool b) {
if (output_ptr_right > SZ - LEN) flush();
output_buffer[output_ptr_right++] = b ? '1' : '0';
}
inline void write_string(const std::string& s) {
for (auto x : s) write_char(x);
}
inline void write_string(const char* s) {
while (*s) write_char(*s++);
}
inline void write_string(char* s) {
while (*s) write_char(*s++);
}
template <typename T>
inline std::enable_if_t<std::is_integral_v<T>, void> write_int(T x) {
if (output_ptr_right > SZ - LEN) flush();
if (!x) {
output_buffer[output_ptr_right++] = '0';
return;
}
if constexpr (std::is_signed<T>::value == true)
if (x < 0) output_buffer[output_ptr_right++] = '-', x = -x;
int i = TWELVE;
std::array<char, SIXTEEN> buf{};
while (x >= TENTHOUSAND) {
memcpy(std::begin(buf) + i,
std::begin(io_pre.num) + (x % TENTHOUSAND) * 4, 4);
x /= TENTHOUSAND;
i -= 4;
}
if (x < HUNDRED) {
if (x < TEN) {
output_buffer[output_ptr_right++] = static_cast<char>('0' + x);
} else {
std::uint32_t q =
(static_cast<std::uint32_t>(x) * MAGIC_MULTIPLY) >>
MAGIC_SHIFT;
std::uint32_t r = static_cast<std::uint32_t>(x) - q * TEN;
output_buffer[output_ptr_right] = static_cast<char>('0' + q);
output_buffer[output_ptr_right + 1] =
static_cast<char>('0' + r);
output_ptr_right += 2;
}
} else {
if (x < THOUSAND) {
memcpy(std::begin(output_buffer) + output_ptr_right,
std::begin(io_pre.num) + (x << 2) + 1, 3),
output_ptr_right += 3;
} else {
memcpy(std::begin(output_buffer) + output_ptr_right,
std::begin(io_pre.num) + (x << 2), 4),
output_ptr_right += 4;
}
}
memcpy(std::begin(output_buffer) + output_ptr_right,
std::begin(buf) + i + 4, TWELVE - i);
output_ptr_right += TWELVE - i;
}
template <typename T_>
IO& operator<<(T_&& x) {
using T = typename std::remove_cv<
typename std::remove_reference<T_>::type>::type;
static_assert(is_custom<T>::value or is_default<T>::value or
is_iterable<T>::value or is_applyable<T>::value);
if constexpr (is_custom<T>::value) {
write_int(x.get());
} else if constexpr (is_default<T>::value) {
if constexpr (is_bool<T>::value) {
write_bool(x);
} else if constexpr (is_string<T>::value) {
write_string(x);
} else if constexpr (is_char<T>::value) {
write_char(x);
} else if constexpr (std::is_integral_v<T>) {
write_int(x);
}
} else if constexpr (is_iterable<T>::value) {
// strings are immune
using E = decltype(*std::begin(x));
constexpr char sep = needs_newline<E> ? '\n' : ' ';
int i = 0;
for (const auto& y : x) {
if (i++) write_char(sep);
operator<<(y);
}
} else if constexpr (is_applyable<T>::value) {
// strings are immune
constexpr char sep =
(any_needs_newline<
T, std::make_index_sequence<std::tuple_size_v<T>>>::value)
? '\n'
: ' ';
int i = 0;
std::apply(
[this, &sep, &i](auto const&... y) {
(((i++ ? write_char(sep) : void()), this->operator<<(y)),
...);
},
x);
}
return *this;
}
template <typename T>
IO& operator>>(T& x) {
static_assert(is_custom<T>::value or is_default<T>::value or
is_iterable<T>::value or is_applyable<T>::value);
static_assert(!is_bool<T>::value);
if constexpr (is_custom<T>::value) {
typename T::internal_value_type y;
read_int(y);
x = y;
} else if constexpr (is_default<T>::value) {
if constexpr (is_string<T>::value) {
read_string(x);
} else if constexpr (is_char<T>::value) {
read_char(x);
} else if constexpr (std::is_integral_v<T>) {
read_int(x);
}
} else if constexpr (is_iterable<T>::value) {
for (auto& y : x) operator>>(y);
} else if constexpr (is_applyable<T>::value) {
std::apply([this](auto&... y) { ((this->operator>>(y)), ...); }, x);
}
return *this;
}
IO* tie(std::nullptr_t) { return this; }
void sync_with_stdio(bool) {}
};
IO io;
#define cin io
#define cout io
void solve(){
int n, d, tt;read(n); read(d); read(tt);
vector<int>prev(n+1, oo);
stack<int>s;
vector<int>t(n+1);
for (int i = 1; i<=n; i++) read(t[i]);
for (int i = 1; i<=n; i++){
s.push(i);
while ((int)s.size() && s.top() - t[s.top()] < i - tt) s.pop();
if ((int)s.size()) prev[i] = s.top();
}
debug(prev);
TreeMin tmin(n+2, prev);
Tree tans(n+1);
for (int i = 1; i<=n; i++){
if (prev[i] <= i){
debug(prev[i], i);
tans.update(1, 0, tans.size-1, prev[i], i, 1);
}
}
while (d--){
int x = tans.find(1, 0, tans.size-1);
debug(x);
bool any = 0;
while (1){
T now = tmin.query(x+1, n+1);
if (now.first > x) break;
debug(now);
tans.update(1, 0, tans.size-1, now.first, now.second, -1);
tmin.update(now.second);
prev[now.second] = oo;
any = 1;
}
if (!any) break;
}
int ans = 0;
debug(prev);
for (int i = 1; i<=n; i++) if (prev[i] != oo) ans++;
cout << ans << "\n";
}
int32_t main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
solve();
return 0;
}
