#include <cstdio>


#define MAXN 17

using namespace std;

int n, g;
int pd[MAXN][1 << MAXN];
int a[MAXN];
inline int max(int a, int b) { if(a > b) return a;
	return b;
}
void clear() {
	for(int i = 0; i <= n; i++)
		for(int j = 0; j < (1 << n); j++)
			pd[i][j] = -1;
}
int solve() {
	
	pd[0][0] = 0;
	for(int i = 0; i <= n; i++) {
		for(int conf = 0; conf < (1 << n); conf++) {
			if(pd[i][conf] < 0) continue;

			pd[i + 1][conf] = g;
			for(int k = 0; k < n; k++) if(!(conf & (1 << k)))
				if(pd[i][conf] - a[k] >= 0)
					pd[i][conf | (1 << k)] = max(pd[i][conf | (1 << k)], pd[i][conf] - a[k]);
		}
		if(pd[i][(1 << n) - 1] >= 0)
			return i;
	}
	return n;
}
int main() {	
	freopen("zebughil.in", "r", stdin);
	freopen("zebughil.out", "w", stdout);

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