#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 50;
int x[MAXN + 5];
long long dp[MAXN + 5][MAXN + 5][MAXN*MAXN + 5];
int main() {
	int N, A;
	scanf("%d%d", &N, &A);
	for(int i=1;i<=N;i++)
		scanf("%d", &x[i]);
	long long ans = 0;
	for(int i=1;i<=N+1;i++)
		dp[i][0][0] = 1;
	for(int i=1;i<=N;i++) {
		for(int j=0;j<=N*A;j++) {
			for(int k=N-i+1;k>=1;k--) {
				dp[k][i][j] = dp[k+1][i][j];
				if( j >= x[k] )
					dp[k][i][j] += dp[k+1][i-1][j-x[k]];
			}
		}
		ans += dp[1][i][i*A];
	}
	printf("%lld\n", ans);
}