#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ff first
#define ss second
#define pb push_back
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define sz(a) (int)(a).size()
const int inf = 1e18;
void solve() {
// cout << "hello\n";
int n, m, s;
cin >> n >> m >> s;
vector<int> a(n);
for(int &i : a) cin >> i;
int ans = inf;
for(int i = 0; i < (1 << n); i++) {
int cnt = 0, sum = 0, pos = 0;
for(int j = 0; j < n; j++) {
if(i & (1 << j)) {
sum += a[j];
pos += j - cnt++;
}
}
if(cnt == m && sum >= s) ans = min(ans, pos);
}
if(ans == inf) cout << "NO\n";
else cout << ans << '\n';
}
signed main() {
ios_base::sync_with_stdio(0);cin.tie(0);
int t = 1;
// cin >> t;
while(t--) solve();
return 0;
}
