#include <cstdio>
#include <cstring>
#include <iostream>
#include <string>
#include <cmath>
#include <bitset>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <deque>
#include <algorithm>
#include <complex>
#include <unordered_map>
#include <unordered_set>
#include <random>
#include <cassert>
#include <fstream>
#include <utility>
#include <functional>
#include <time.h>
#include <stack>
#include <array>
#define popcount __builtin_popcount
using namespace std;
using ll=long long;
typedef pair<int, int> P;
const ll MOD=1e9+7;
int main()
{
    int n, k; cin>>n>>k;
    int a[101];
    for(int i=0; i<n; i++){
        cin>>a[i];
        a[i]-=k;
    }
    ll dp[101][20200]={};
    const int geta=100;
    dp[0][geta*n]=1;
    for(int i=0; i<n; i++){
        for(int j=0; j<=2*geta*n; j++){
            if(dp[i][j]==0) continue;
            (dp[i+1][j]+=dp[i][j])%=MOD;
            (dp[i+1][j+a[i]]+=dp[i][j])%=MOD;
        }
    }
    ll ans=MOD-1;
    for(int i=geta*n; i<=2*geta*n; i++) (ans+=dp[n][i])%=MOD;
    cout<<ans<<endl;
    return 0;
}