import std.stdio, std.array, std.string, std.conv, std.algorithm;
import std.typecons, std.range, std.random, std.math, std.container;
import std.numeric, std.bigint, core.bitop;

immutable long MOD = 998244353;

void main() {
    auto s = readln.split.map!(to!int);
    auto N = s[0];
    auto W = s[1].to!long;
    auto A = readln.split.map!(to!long).array;
    long ans = 0;

    auto x = new long[](1<<N);
    foreach (mask; 1..1<<N) {
        foreach (i; 0..N) if ((mask >> i) & 1) x[mask] += A[i];
    }

    foreach (mask; 1..1<<N) {
        long tmp = 0;
        for (int sub = mask; ; sub = (sub - 1) & mask) {
            auto y = x[mask] - x[sub]/2;
            if (y == W) tmp = 1;
            if (sub == 0) break;
        }
        ans += tmp;
    }

    ans.writeln;
}