#include<stdio.h>
#include<math.h>
int findTargetSumWays(int m, int S) {
int sum = 0,num[m]={0};
printf("请输入元素:\n");
for (int i = 0; i<m; i++){
scanf("%d",&num[i]);
sum+=num[i];
}
if (abs(S) > sum) return 0; // 此时没有方案
if ((S + sum) % 2 == 1) return 0; // 此时没有方案
int bagSize = (S + sum) / 2;
int dp[bagSize+1]={0};
dp[0] = 1;
for (int i = 0; i < m; i++) {
for (int j = bagSize; j >= num[i]; j--) {
dp[j] += dp[j - num[i]];
}
}
return dp[bagSize];
}
int main(){
int m,s;
scanf("%d %d",&m,&s);
int len=findTargetSumWays(m,s);
printf("有%d种",len);
return 0;
}