using namespace std;

#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <vector>
#include <string>
#include <algorithm>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <queue>
#include <utility>
#include <functional>

#define pb push_back
#define f first
#define s second
#define sz size
#define II inline
#define ll long long
#define db double
#define FOR(i,a,b) for(ll i=a;i<=b;++i)
#define all(v) v.begin() , v.end()
#define C(v) C.erase( all(v) )
#define FORit(it,v) for(it = (v).begin();it != (v).end();++it)
#define mp make_pair

#define IN  "zebughil.in"
#define OUT "zebughil.out"
#define N_MAX 18
//#define oo 1684300900

ll V[N_MAX],A[N_MAX][1<<N_MAX];
ll oo,G,N;

II void scan()
{
	scanf("%lld%lld\n",&N,&G);
	FOR(i,1,N)
		scanf("%lld",&V[i]);
}

/*
II void cfg(int x)
{
	for(;x;x >>= 1)
		if(x & 1)
			printf("1");
		else
			printf("0");
}
*/

II void solve()
{
	memset(A,300,sizeof(A));
	A[0][0] = 0;
	oo = A[1][1]; 
	FOR(j,0,(1<<N)-1)
	FOR(i,0,N-1)
	{
		if(A[i][j] == oo)
			continue;
		FOR(k,0,N-1)
			if( !(j & (1<<k)) )
			{
				//int aux = i;
				
				
				if(A[i][j] + V[k+1] >= G)
					A[i+1][j | (1<<k)] = min(A[i+1][j | (1<<k)],A[i][j] + V[k+1] - G);
				else
					A[i][j | (1<<k)] = min(A[i][j | (1<<k)],A[i][j] + V[k+1]);
				//printf("cu %d camione si ",aux);
				
				//cfg(j | (1<<k));
				//printf(" avem %d\n",A[aux][j | (1<<k)]);
			}	
		
	}	
	
	FOR(i,0,N)
		if(A[i][(1<<N)-1] != oo)
		{
			if(A[i][(1<<N)-1])
				printf("%d\n",i+1);
			else
				printf("%d\n",i);
			return;
		}	
}

int main()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	FOR(k,1,3)
	{
		scan();
		solve();
	}	
	return 0;
}