#include <iostream>
#include <vector>
using namespace std;
int main(){
    int N, K;
    const int MOD = 1e9 + 7;
    cin >> N >> K;
    vector<int> A(N);
    for(int i = 0; i < N; i++) {
        cin >> A[i];
        A[i] -= K;
    }
    vector<vector<long long>> dp(N + 1, vector<long long> (20010, -1));
    dp[0][10000] = 1;
    for(int i = 0; i < N; i++){
        for(int j = 0; j < 20010; j++){
            if(dp[i][j] == -1) continue;
            if(dp[i + 1][j] == -1) {
                dp[i + 1][j] = dp[i][j];
            }
            else dp[i + 1][j] = (dp[i + 1][j] + dp[i][j]) % MOD;
            if(dp[i + 1][j + A[i]] == -1) dp[i + 1][j + A[i]] = dp[i][j];
            else dp[i + 1][j + A[i]] = (dp[i + 1][j + A[i]] + dp[i][j]) % MOD;
        }
    }
    long long ans = -1;
    for(int i = 10000; i < 20010; i++){
        if(dp[N][i] != -1) ans = (ans + dp[N][i]) % MOD;
    }
    cout << ans << endl;
}