Coin Combinations II

#include <iostream>
using namespace std;

int dp[1000001],d[100];

int main()
{
    int n,m,min1,i,j;
    cin>>n>>m;
    dp[0]=1;
    min1=999999999;
    for(i=0;i<n;i++){
        cin>>d[i];
        min1=min(min1,d[i]);
    }
    //printf("%d ",min1);
    for(j=0;j<n;j++){
        for(i=min1;i<=m;i++){
            if(i-d[j]>=0){
                dp[i]=(dp[i]+dp[i-d[j]])%1000000007;
            }
        }
        //printf("i:%d dp:%d \n",i,dp[i]);
    }
    cout<<dp[m];
    return 0;
}