#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define INF 999999999
#define M_PI 3.14159265358979323846
#define ALL(X) (X).begin(),(X).end()

#ifdef __LOCAL
    #define DBG(X) cout << #X << " = " << (X) << endl;
    #define SAY(X) cout << (X) << endl;
#else
    #define DBG(X)
    #define SAY(X)
#endif

#ifdef __LOCAL
    #include <filesystem>
    namespace fs = std::filesystem;
#endif

using namespace std;

using ll = long long int;
using ull = unsigned long long int;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

int dx[]={1, 0, -1, 0, 0};
int dy[]={0, 1, 0, -1, 0};
const int INT_INF = (int)(2e9);
const ll  LL_INF = (ll)(2e18);
const int NIL = -1;
static mt19937 _g(time(nullptr));
 
std::string pad(int num){ char buffer[4]; std::snprintf(buffer, sizeof(buffer), "%03d", num); return buffer;}
inline ll randint(ll a, ll b) { ll w = (_g() << 31LL) ^ _g(); return a + w % (b - a + 1); }
inline void fast_io() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); };
template<typename T> inline T sign(T x) { return T(x > 0) - T(x < 0); }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const pair<T, S> p) { cout << "[" << p.first << ";" << p.second << "]"; return os; }
template<typename T, typename S> inline ostream& operator<<(ostream& os, const map<T, S> p) { for (auto el : p) cout << "[" << el.first << "," << el.second << "] "; return os; }
template<typename T> inline ostream& operator<<(ostream& os, const vector<T>& v) { for (auto el : v) cout << el << " "; return os; }
template<typename T> inline T fetch() { T ret; cin >> ret; return ret; }
template<typename T> inline vector<T> fetch_vec(int sz) { vector<T> ret(sz); for (auto& elem : ret) cin >> elem; return ret; }

int N,A;
vector<int> Xp,Xm,Xz;

void input(){
    #ifdef __LOCAL
        fs::path path_to_file = __FILE__;
        fs::path input,output;
        input = output = path_to_file.parent_path();
        input += string("/input/") + string(path_to_file.stem()) + string(".txt");
        output += string("/output/") + string(path_to_file.stem()) + string(".txt");
        freopen(input.c_str(), "r", stdin);
        freopen(output.c_str(), "w", stdout);
    #endif
    cin >> N >> A;
    for (int i = 0; i < N; i++)
    {
        int x;
        cin >> x;
        x -= A;
        if(x>0) Xp.push_back(x);
        else if(x<0) Xm.push_back(-x);
        else Xz.push_back(x);
    }
    
}


int solve(){
    ll szp, szm, szz;
    szp = Xp.size();
    szm = Xm.size();
    szz = Xz.size();

    ll ans=0;
    if(szp==0 || szm==0){
        ans += pow(2LL,szz)-1LL;
        cout << ans << endl;
        return 0;
    }

    vector<map<int,ll>> dpp(szp+1);
    // dpp[0][0]=0;
    dpp[0][Xp[0]]=1;
    for (int i = 0; i < szp-1; i++)
    {
        for(auto c:dpp[i]){
            dpp[i+1][c.first] += c.second; 
            dpp[i+1][c.first+Xp[i+1]] += c.second; 
        }
        dpp[i+1][Xp[i+1]]++;
    }

    vector<map<int,ll>> dpm(szm+1);
    // dpm[0][0]=0;
    dpm[0][Xm[0]]=1;
    for (int i = 0; i < szm-1; i++)
    {
        for(auto c:dpm[i]){
            dpm[i+1][c.first] += c.second; 
            dpm[i+1][c.first+Xm[i+1]] += c.second;
        }
        dpm[i+1][Xm[i+1]]++;
    }
    // for (int i = 0; i < 2500; i++)
    // {
    //     if(dpp[szp-1][i]>0 && dpm[szm-1][i]>0){
    //         ans += dpp[szp-1][i]*dpm[szm-1][i]*pow(2,szz);
    //     }
    // }
    int i;
    for (auto p:dpp[szp-1])
    {
        i=p.first;
        if(dpp[szp-1][i]>0 && dpm[szm-1][i]>0){
            ans += dpp[szp-1][i]*dpm[szm-1][i]*pow(2LL,szz);
        }
    }

    DBG(Xp)
    DBG(Xm)
    DBG(Xz)
    DBG(dpp[szp-1])
    DBG(dpm[szm-1])
    // 0の集合から1個以上0を選ぶ。
    if(szz>0) ans += (pow(2LL,szz)-1LL);
    cout << ans << endl;
    return 0;    
}

int main(){
    input();
    solve();
    return 0;
}


Measured memory_bytes: 1280