#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize("O3")
#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;
const int Max = 1e6 + 7, Inf = 1e9 + 7;
void print(bool x) { cout << (x ? "YES" : "NO") << endl; }
string tostring (__int128 x)
{
string ans = "";
while(x > 0)
{
ans += (x % 10 + '0');
x /= 10;
}
reverse(all(ans));
return ans;
}
void solve()
{
int n, d, t; cin >> n >> d >> t;
vector <int> v(n), s(n+1), f;
for(auto& u : v) cin >> u;
int ans = n;
for(int i = n-1; i >= 0; i--)
{
if(v[i] > t){
s[i] = 1;
}
else {
f.push_back(0);
for(int j = 0; j < min(n-i, t - v[i]); j++)
{
f.back() += s[j+i];
s[j+i] = 0;
}
}
}
sort(all(f));
_for(i, n) ans -= s[i];
while (d--)
{
ans = ans - f.back();
f.pop_back();
}
cout << ans << endl;
}
int32_t main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
int Q = 1; //cin >> Q;
while (Q--)
{
solve();
}
return 0;
}
