#include using namespace std; #define rep(i,n) for(int (i)=0;(i)<(n);(i)++) #define rep3(i,m,n) for(int (i)=m;(i)<=(n);(i)++) #define rep3rev(i,m,n) for(int (i)=m;(i)>=(n);(i)--) #define all(a) (a.begin()),(a.end()) #define rall(a) (a.rbegin()),(a.rend()) #define fi first #define se second #define pb push_back #define eb emplace_back using ll = long long; using vll = vector; using vi = vector; using vvi = vector>; using P = pair; void Main(){ const int MOD = 1e9 + 7; int n, k; cin >> n >> k; vi a(n); rep(i, n) { cin >> a[i]; a[i] -= k; } vector dp(n+5, vll(20010, 0)); dp[0][10000] = 1; rep(i, n){ rep3(S, -10000, 10000){ // cout << i << " " << S << endl; if(S+10000-a[i] >= 0) { dp[i+1][S+10000] += (dp[i][S+10000] + dp[i][S+10000-a[i]]); dp[i+1][S+10000] %= MOD; }else{ dp[i+1][S+10000] = dp[i][S+10000]; } } } ll ans = 0; rep3(i, 10000, 20001) { ans += dp[n][i]; ans %= MOD; } cout << (ans + MOD - 1) % MOD << endl; return; } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); cout << fixed << setprecision(15); Main(); return 0; }