Link to this code:
https://cses.fi/paste/fb8283dd74e36c37103d53d/#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[102][maxn];
void solve(){
int n,x;
cin>>n>>x;
int a[n+1];
for(int i=1; i<=n; i++){
cin>>a[i];
ans[i][0] = 1;
}
for(int j = 1; j <= n; j++){
for(int i = 1; i <= x; i++){
ans[j][i] = ans[j - 1][i];
if(a[j] <= i){
ans[j][i] = (ans[j][i] + ans[j][i - a[j]]) % mod;
}
}
}
cout << ans[n][x] << endl;
}
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();
}