//Never stop trying
#include "bits/stdc++.h"
using namespace std;
#define boost ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0)
typedef long long ll;
typedef string str;
typedef long double ld;
typedef pair<int, int> pi;
#define fi first
#define se second
typedef vector<int> vi;
typedef vector<pi> vpi;
#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
#define endl "\n"
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
const int MOD = 1e9 + 7; //998244353
const ll INF = 1e18;
const int MX = 2e6 + 10;
const int nx[4] = {0, 0, 1, -1}, ny[4] = {1, -1, 0, 0}; //right left down up
template<class T> using V = vector<T>;
template<class T> bool ckmin(T& a, const T& b) { return a > b ? a = b, 1 : 0; }
template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; }
ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } // divide a by b rounded up
//constexpr int log2(int x) { return 31 - __builtin_clz(x); } // floor(log2(x))
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
//mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
ll random(ll a, ll b){
return a + rng() % (b - a + 1);
}
#ifndef LOCAL
#define cerr if(false) cerr
#endif
#define dbg(x) cerr << #x << " : " << x << endl;
#define dbgs(x,y) cerr << #x << " : " << x << " / " << #y << " : " << y << endl;
#define dbgv(v) cerr << #v << " : " << "[ "; for(auto it : v) cerr << it << ' '; cerr << ']' << endl;
#define here() cerr << "here" << endl;
void IO() {
#ifdef LOCAL
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
#endif
}
/////////////////////////ONLY CLEAN CODES ALLOWED/////////////////////////
int N,K,T;
vpi vec;
vi t;
void upd(int i){
i++;
for(;i<sz(t); i+=i&-i) t[i]++;
}
int get(int i){
i++;
int ans=0;
for(;i;i-=i&-i){
ans+=t[i];
}
return ans;
}
int main() {
boost; IO();
cin>>N>>K>>T;
FOR(i,0,N){
int t; cin>>t;
if(t<=T) vec.eb(i,min(i+T-t,N-1));
}
int ans=0;
vi sum(N+1,0);
for(auto x: vec){
sum[x.fi]++;
sum[x.se+1]--;
}
int cur=0;
FOR(i,0,N){
cur+=sum[i];
if(cur) ans++;
}
int rep=K;
while(K--){
vi v[N];
for(auto x: vec){
int l=x.fi,r=x.se;
v[r].pb(r);
if(l) v[l-1].pb(-r);
}
vi R(N,-1);
multiset<int,greater<int>>s;
ROF(i,0,N){
for(auto x: v[i]){
if(x>=0) s.insert(x);
else s.erase(s.find(-x));
}
if(sz(s)) R[i]=*s.begin();
}
FOR(i,0,N) v[i].clear();
for(auto x: vec){
int l=x.fi,r=x.se;
v[l].pb(r);
}
set<int>free;
vi val(N,0);
t.assign(N+1,0);
ROF(i,0,N){
if(R[i]!=-1) val[i]=R[i]-i-get(R[i]);
for(int j: v[i]){
while(sz(free) && *free.begin()<=j){
upd(*free.begin());
free.erase(free.begin());
}
}
if(!sz(v[i])) free.insert(i);
else upd(i);
}
int idx=0;
FOR(i,0,N){
if(val[i]>val[idx]) idx=i;
}
ans-=val[idx];
for(auto &x: vec){
int l=x.fi,r=x.se;
if(idx>=l) ckmin(x.se,idx);
}
}
cout << ans << endl;
return 0;
}
//Change your approach
