#include<bits/stdc++.h>
#define pii pair <int, int>
#define fr first
#define sc second
#define int long long
#define N 4010
using namespace std;
int range[N][N];
int v[N];
int dp[N][N];
int n, d, t;
int solve(int l, int r){
if(range[l][r] != -1) return range[l][r];
if(l > r) return 0;
if(v[l] > t) return range[l][r] = solve(l+1,r);
int sum = t - v[l] + 1;
if(l+sum > r) return range[l][r] = min(r-l+1,sum);
return range[l][r] = sum + solve(l+sum, r);
}
int32_t main(){
cin >> n >> d >> t;
memset(range, -1, sizeof range);
for(int i = 1;i <= n;i++) cin >> v[i];
for(int i = 0;i <= d;i++){
dp[0][i] = 0;
}
for(int pos = 1;pos <= n;pos++){
for(int qtd = 0;qtd <= d;qtd++){
dp[pos][qtd] = solve(1, pos);
if(qtd == 0) continue;
for(int i = pos-1;i >= 0;i--){
dp[pos][qtd] = min(dp[pos][qtd], dp[i][qtd-1] + solve(i+1, pos));
}
}
}
cout << dp[n][d] << '\n';
return 0;
}
