#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<x.F<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
const int N=505,inf=2e9;
int n,d,t,ans,a[N],b[N],ps[N],L[N],R[N],ok[N];
void do_it(){
fill(ps,ps+N,0);
f(i,1,n+1){
if(ok[i]) ps[L[i]]++,ps[R[i]]--;
}
f(i,1,n+1) ps[i]+=ps[i-1];
}
int find(){
int id=1;
f(i,1,n+1){
if(ps[i]>=ps[id]) id=i;
}
return id;
}
void pick(int x){
ans+=ps[x];
f(i,1,n+1) if(L[i]<=x && x<R[i]) ok[i]=0;
}
int32_t main(){
ios:: sync_with_stdio(0), cin.tie(0), cout.tie(0);
vector<int> vec(1);
b[0]=N;
cin>>n>>d>>t; t++;
f(i,1,n+1) cin>>a[i];
f(i,1,n+1){
ok[i]=1;
if(a[i]<t){
L[i]=R[i]=i;
b[i]=min(n,i+t-a[i]-1);
while(b[vec.back()]<=b[i]) vec.pop_back();
vec.pb(i);
continue ;
}
while(b[vec.back()]<i) vec.pop_back();
L[i]=vec.back()+1;
R[i]=i+1;
}
do_it();
pick(1);
f(i,0,d){
do_it();
pick(find());
}
cout<<n-ans;
}
