Link to this code: https://cses.fi/paste/7ed36be30ce6bcdd103d435/
#include "bits/stdc++.h"
using namespace std;
#define mod 1000000007
#define ll long long
#define ff first
#define ss second
#define pb push_back
#define N 24
#define maxn 1000005
#define INF (int)1e9

int ans[maxn][105];

void solve(){
	int n,x;
	cin>>n>>x;
	int a[n+5];
	for(int i=1; i<=n; i++)cin>>a[i];
	for(int i=0; i<=n; i++)ans[0][i]=1;
	sort(a+1,a+1+n);
	for(int i=1; i<=x; i++){
		for(int j=1; j<=n; j++){
			if(a[j]<=i)ans[i][j]=ans[i][j-1]+ans[i-a[j]][j];
			else ans[i][j]=ans[i][j-1];
			if(ans[i][j]>=mod)ans[i][j]-=mod;
		}
	}
	cout<<ans[x][n];
}
 
int main(){
	// freopen("in.txt","w",stdout);
	// freopen("out.txt","r",stdin);
	ios_base::sync_with_stdio(0); cin.tie(0);
	ll t=1;
	// cin>>t;
	while(t--) solve();
}