ソースコード
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<ll, ll> P;
#define fi first
#define se second
#define repl(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define rep(i,n) repl(i,0,n)
#define all(x) (x).begin(),(x).end()
#define dbg(x) cout<<#x"="<<x<<endl
#define mmax(x,y) (x>y?x:y)
#define mmin(x,y) (x<y?x:y)
#define maxch(x,y) x=mmax(x,y)
#define minch(x,y) x=mmin(x,y)
#define uni(x) x.erase(unique(all(x)),x.end())
#define exist(x,y) (find(all(x),y)!=x.end())
#define bcnt __builtin_popcount
#define INF 1e16
#define mod 1000000007
ll N,K,B;
ll A[22];
ll w[1<<16],sz[1<<16];
int main(){
cin>>N>>K>>B;
rep(i,N)cin>>A[i];
rep(i,1<<N){
rep(j,N)if((i>>j)&1)w[i]+=A[j];
}
rep(S,1<<N){
sz[S]=INF;
}
sz[0]=0;
repl(S,1,1<<N){
for(ll T=S;T>=0;T--){
T&=S;
if(w[T]<=B)minch(sz[S],sz[S^T]+1);
}
}
if(sz[(1<<N)-1]>K)cout<<sz[(1<<N)-1]-K+N-K<<endl;
else cout<<N-K<<endl;
return 0;
}