#include <iostream>
#include <cstdio>
#include <algorithm>
#include <queue>
using namespace std;
 
typedef long long ll;
 
ll dp[51][51][2501];
ll N, A, x[51];
 
 
void solve() {
    dp[0][0][0] = 1;
    
    for (ll i = 1; i <= N; i++) {
        for (ll j = 0; j <= N; j++) {
            for (ll k = 0; k <= 2500; k++) {
                //not select
                dp[i][j][k] = dp[i-1][j][k];
                if (j > 0 && k >= x[i])
                    dp[i][j][k] = dp[i-1][j][k] + dp[i-1][j-1][k - x[i]];
            }
        }
    }
    
    ll ans = 0;
    for (int i = 1; i <= N; i++) {
            ans += dp[N][i][i*A];
    }
    
    cout << ans << endl;
}
 
int main() {
    
    cin >> N >> A;
    for (ll i = 1; i <= N; i++)
        cin >> x[i];
    
    
    solve();
    
    
    
    return 0;
}