0pts,求调

#include <iostream>
#define mod 1000007
using namespace std;
int n,m,a[101],dp[101][101];
int main(){
    cin>>n>>m;
    for (int i=1;i<=n;i++){
        cin>>a[i];
    }
    for (int i=1;i<=n;i++){
        dp[i][1]=1;
    }
    for (int i=1;i<=n;i++){
        for (int j=2;j<=m;j++){
            for (int k=1;k<=min(a[i],j);k++){
                dp[i][j]+=dp[i-1][k];
                dp[i][j]%=mod;
            }
        }
    }
    cout<<dp[n][m];
    return 0;
}