#include <bits/stdc++.h>
#define rep(i,n) for(int i = 0; i < (n); ++i)
#define srep(i,s,t) for (int i = s; i < t; ++i)
#define drep(i,n) for(int i = (n)-1; i >= 0; --i)
using namespace std;
typedef long long int ll;
typedef pair<int,int> P;
#define yn {puts("YES");}else{puts("NO");}
#define MAX_N 200005

int main() {
    int n, K;
    cin >> n >> K;
    int a[n];
    rep(i,n){
        cin >> a[i];
        a[i] -= K;
    }

    ll dp[30000] = {};
    const ll MOD = 1000000007;

    rep(i,n){
        ll dp2[30000] = {};
        rep(j,30000){
            if(dp[j] > 0){
                dp2[j+a[i]] += dp[j];
            }
        }
        dp2[15000+a[i]]++;
        rep(j,30000){
            dp[j] = (dp[j]+dp2[j]) % MOD;
        } 
    }

    ll ans = 0;
    srep(i,15000,30000) ans = (ans + dp[i]) % MOD;
    cout << ans << endl;
    return 0;
}