orz

#include <bits/stdc++.h>
using namespace std;
#define int long long
int n, m;
struct A {
	double v;
	int mk = 0;
} a[1000005];
int cnt;
struct B {
	double val;
	int as;
} f[1000005], s[1000005];
void read() {
	cin >> n >> m;
	int cn = n;
	for (int i = 1; i <= n; i++) {
		cin >> a[i].v;
		a[++cn].v = a[i].v / 2;
		a[cn].mk = 1;
	}
	n = cn;
}
void dfs (int nw, int st, int fl, int res, int ans, int la) {
	if (nw > st + 1)return ;
	if (fl) {
		if (la != res) {
			f[++cnt].val = res;
			f[cnt].as = ans;
		}
	} else {
		if (la != res) {
			s[++cnt].val = res;
			s[cnt].as = ans;
		}
	}
	dfs (nw + 1, st, fl, res + a[nw].v, ans + a[nw].mk, res);
	dfs (nw + 1, st, fl, res, ans, res);
}
bool cmp (B a, B b) {
	if (a.val != b.val) {
		return a.val < b.val;
	}
	return a.as < b.as;
}
int bs(int b, int cnt) {
	int l = 1, r = cnt;
	while (l + 1 < r) {
		int id = (l + r) / 2;
		if (s[id].val < b)l = id;
		else r = id;
	}
	return r;
}
main() {
	read();
	int mid = ((1 + n) >> 1) | 1;
	cnt = 0;
	dfs (1, mid, 1, 0, 0, -0x7fffffff);
	sort (f + 1, f + 1 + cnt, cmp);
	int lenf = cnt;
	cnt = 0;
	dfs (mid + 1, n, 0, 0, 0, -0x7fffffff);
	sort (f + 1, f + 1 + cnt, cmp);
	int lens = cnt;
	int ans = 0x7fffffff;
	for (int i = 1; i <= lenf; i++) {
		int fi = m - f[i].val;
		if (fi < 0)continue;
		int p = bs(fi, lens);
		if (p >= 1 && p <= lens) {
			if (s[p].val == fi)
				ans = min(ans, f[i].as + s[p].as);
		}
	}
	cout << ans << '\n';
	return 0;
}