#include <iostream>
using namespace std;
int arr[100];
const int MOD = 1e9 + 7;
const int maxn = 1e6 + 10;
int x,n;
int dp[maxn];
int rec(int a){
    if(dp[a] != -1) {
        return dp[a];
    }
    if (a==0){
        return 1;
    }
    else {
    int sum=0;
    for (int i=n-1;i>=0;i--){
        if (a-arr[i]>=0){
        sum=(sum+rec(a-arr[i])) % MOD;

    }
    }
        dp[a] = sum;
    return sum;
    }
}

int main(){
    cin>>n;
    cin>>x;
    for(int i=0;i<n;i++){
        cin>>arr[i];

    }
    for(int i = 0; i < maxn; ++i) {
        dp[i] = -1;
    }
    cout<<rec(x);

}