#include<cstdio>
#include<iostream>
#include<algorithm>
#include<cstring>
#include<cmath>
using namespace std;
int n,m,a[105],ans=0,b[105];
bool v[105]={0};
void dfs(int t,int tot){
	if(tot==m){
		ans++;
		return;
	}
	if(tot>m) return;
	for(int i=b[t-1]+1;i<=n;i++){
		if(!v[i]){
			v[i]=1;
			b[t]=i;
			dfs(t+1,tot+a[i]);
			v[i]=0;
		}
	}
}
int main(){
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%d",&a[i]);
	dfs(1,0);
	printf("%d\n",ans);
	return 0;
}