#include<bits/stdc++.h>
//#include<atcoder/all>
using namespace std;
//using namespace atcoder;
#define rep(i,n) for(ll i=0; i<n; i++)
#define rrep(i,n) for(ll i=n-1; i>=0; i--)
#define print(a) cout<<a<<endl
typedef long long ll;
#define yn(flg) if(flg){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}
#define YN(flg) if(flg){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}
#define so(a) sort(a.begin(),a.end())
#define mp make_pair
#define vi vector<int>
#define vl vector<ll>
#define vs vector<string>
#define pb push_back
#define a2i(a,s) (ll)(a-s)
#define i2a(s,a) (char)(s+a)
#define ssize(a) a.size()
typedef pair<int, int> Pii;
typedef pair<int, ll> Pil;
typedef pair<pair<ll,ll>,ll> P3;
typedef pair<pair<ll,ll>,pair<ll,ll>> P4;
typedef pair<ll, ll> Pll;
typedef pair<ll,Pll> Plll;
typedef pair<Pii, int> Piii;
const ll INF = 1000000000000000000;
template<class T> inline bool chmin(T& a, T b) {
if (a > b) {
a = b;
return true;
}
return false;
}
template<class T> inline bool chmax(T& a, T b) {
if (a < b) {
a = b;
return true;
}
return false;
}
using ull=unsigned long long;
int main(){
//入力
cin.tie(0);
ios::sync_with_stdio(0);
ll n,f,t;
cin>>n>>f>>t;
vector<ll> a(n);
rep(i,n)cin>>a[i];
//判定
vector<vector<vector<ll> > > v(n+1,vector<vector<ll> > (5100,vector<ll>(n+1,0)));
for(ll i=0;i<n;i++){
for(ll j=0;j<5051;j++){
for(ll k=1;k<=n;k++){
if(i<k-1)break;
if(j<(i-k+1))v[i+1][j][k]=v[i][j][k];
else v[i+1][j][k]=max(v[i][j-(i-k+1)][k-1]+a[i],v[i][j][k]);
}
}
}
ll ans=INF;
for(ll i=0;i<5051;i++){
if(v[n][i][f]>=t)ans=min(ans,i);
}
if(ans==INF)cout<<"NO"<<endl;
else cout<<ans<<endl;
return 0;
}
