#include <iostream>
#include <vector>
#include <algorithm>

using namespace std;

typedef long long ll;

const ll mod = 1000000007;

int main(){
    int n , k;
    cin >> n >> k;
    vector<int> a(n);
    for(int i = 0; i < n; i++){
        cin >> a[i];
        a[i] -= k;
    }
    
    vector<ll> dp(22222 , 0);
    for(int i = 0; i < n; i++){
       int j = a[i] + 10000;
       vector<ll> dp2 = dp;
       for(int k = 0; k <= 20000; k++){
           dp[k] %= mod;
           if(k + a[i] > 0){
             dp2[k + a[i]] += dp[k];
             dp2[k + a[i]] %= mod;
           }
       }
       dp2[j] += 1;
       dp2[j] %= mod;
       dp = dp2;
    }
    
    ll ans = 0;
    for(int i = 10000; i <= 20000; i++){
        //cout << i << " : " << dp[i] << endl;
        ans += dp[i];
        ans %= mod;
    }
    cout << ans << endl;
    
    return 0;
}