#include <bits/stdc++.h>
using namespace std;
long long int dp[51][51][2501];

int main() {
	long long int N,A;
	cin >> N >> A;
	int x[N];
	for(int i = 0;i < N;i++) {
		cin >> x[i];
	}
	long long ans = 0;
	dp[0][0][0] = 1;
	for (int i = 0;i < N;i++) {
		for (int j = 0;j < N;j++) {
			for (int k = 0;k < 2501;k++) {
				if (k<x[i]) {dp[i+1][j][k] = dp[i][j][k];}
				else {
					dp[i+1][j+1][k] = dp[i][j+1][k] + dp[i][j][k-x[i]];
				}
			}
		}
	}
	for (int i = 1;i < N+1;i++) {
		ans+=dp[N][i][i*A];
	}
	cout << ans << endl;
}