#include<bits/stdc++.h>
using namespace std;
vector<int> arr;
vector<vector<int>> C;
vector<vector<int>> dp;
int n,d,t;
int INF = numeric_limits<int>::max()/2;
int cost(int l, int r){
int time = INF;
int cnt = 0;
for(int i = l; i <= r; i++){
time = min(time+1, arr[i]);
if(time <= t){
cnt++;
}
}
return cnt;
}
void calc(int k, int l, int r, int optl, int optr){
if(l >= r) return;
int mid = (l+r)/2;
int opt = -1;
if(mid == 3){
cerr<<"";
}
for(int j = optl; j <= min(optr,mid); j++){
if(dp[k][mid] > dp[k-1][j-1] + C[j][mid]){
opt = j;
dp[k][mid] = dp[k-1][j-1] + C[j][mid];
}
}
calc(k,l,mid,optl,opt);
calc(k,mid+1,r,opt,optr);
}
int main(){
cin >> n >> d >> t;
arr.resize(n);
for(int i = 0; i < n; i++){
cin >> arr[i];
}
C.resize(n, vector<int>(n));
for(int i = 0; i < n; i++){
for(int j = i; j < n; j++){
C[i][j] = cost(i,j);
}
}
// d pillows, [0;i]
dp.resize(d+1, vector<int>(n, INF));
for(int i = 0; i < n; i++){
dp[0][i] = C[0][i];
}
for(int i = 1; i <= d; i++){
calc(i,0,n,0,n);
}
cout << dp[d][n-1] << endl;
}
