#define _USE_MATH_DEFINES #include using namespace std; #define FOR(i,m,n) for(int i=(m);i<(n);++i) #define REP(i,n) FOR(i,0,n) #define ALL(v) (v).begin(),(v).end() using ll = long long; constexpr int INF = 0x3f3f3f3f; constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL; constexpr double EPS = 1e-8; constexpr int MOD = 1000000007; // constexpr int MOD = 998244353; constexpr int DY[]{1, 0, -1, 0}, DX[]{0, -1, 0, 1}; constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1}, DX8[]{0, -1, -1, -1, 0, 1, 1, 1}; template inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; } template inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; } struct IOSetup { IOSetup() { std::cin.tie(nullptr); std::ios_base::sync_with_stdio(false); std::cout << fixed << setprecision(20); } } iosetup; int main() { int n, w; cin >> n >> w; vector a(n); REP(i, n) cin >> a[i]; int ans = 0; REP(bit, 1 << n) { vector b{0}; REP(i, n) { if (bit >> i & 1) { vector c; for (int bi : b) { c.emplace_back(bi + a[i] / 2); c.emplace_back(bi + a[i]); } sort(ALL(c)); while (!c.empty() && c.back() > w) c.pop_back(); b.swap(c); } } ans += !b.empty() && b.back() == w; } cout << ans << '\n'; return 0; }