#include <stdio.h>

#define nmax 18
#define confmax 262144

int n,g,z[nmax],a[confmax],b[confmax],bits[nmax],aux,nconf;

int solve() {
	for(int i = 0; i < 1 << (n + 1); i++) {
		a[i] = -1;
		b[i] = n + 1;
	}
	a[0] = g; b[0] = 1;

	for(int i = 0; i < 1 << n; i++) {
		aux = i;
		for(int j = 1; j <= n; j++) {
			bits[j] = aux % 2;
			aux /= 2;
		}
		for(int j = 1; j <= n; j++)
			if(bits[j] == 0) {
				nconf = i + (1 << (j - 1));
				if(a[i] >= z[j]) {
					if(b[i] < b[nconf] || (b[i] == b[nconf] && a[i] - z[j] > a[nconf])) {
						b[nconf] = b[i];
						a[nconf] = a[i] - z[j];
					}
				}
				else {
					if(b[i] + 1 < b[nconf] || (b[i] + 1 == b[nconf] && g - z[j] > a[nconf])) {
						b[nconf] = b[i] + 1;
						a[nconf] = g - z[j];
					}
				}
			}
	}

	return b[(1 << n) - 1];
}


int main() {
	freopen("zebughil.in","r",stdin);
	freopen("zebughil.out","w",stdout);

	for(int t = 1; t <= 3; t++) {
		scanf("%d%d",&n,&g);
		for(int i = 1; i <= n; i++) scanf("%d",&z[i]);
		printf("%d\n",solve());
	}

	return 0;
}