#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#undef _P
#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ITR(x,c) for(__typeof(c.begin()) x=c.begin();x!=c.end();x++)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
//-------------------------------------------------------

int N,K;
ll dp[30000];
const ll mo=1000000007;

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>N>>K;
	dp[15000]=1;
	FOR(i,N) {
		cin>>x;
		x-=K;
		if(x==0) {
			FOR(j,30000) dp[j]=dp[j]*2%mo;
		}
		else if(x>0) {
			for(j=25000;j>=5000;j--) (dp[j+x]+=dp[j])%=mo;
		}
		else {
			for(j=5000;j<=25000;j++) (dp[j+x]+=dp[j])%=mo;
		}
	}
	ll ret=mo-1;
	for(j=15000;j<=25000;j++) if(dp[j]) {
		ret+=dp[j];
	}
	cout<<ret%mo<<endl;
	
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}