#include <bits/stdc++.h>
using namespace std;

const unsigned int mod=1000000007;

unsigned int dp[10010][2];
long long sum[10010];

long long dist(unsigned int lo,unsigned int hi)
{
    return sum[hi-1]-sum[lo-1];
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    unsigned int in,d,lo,hi,n,i,j;
    cin>>n>>d;
    for(i=1;i<=n;i++)
    {
        cin>>in;
        sum[i]=sum[i-1];
        sum[i]+=in;
    }
    dp[1][0]=1;
    long long maxdist=dist(1,2);
    for(hi=3;hi<=n+1;hi++)
    {
        for(lo=1;lo<hi;lo++)
        {
            dp[lo][hi%2]=0;
            if(dist(lo,hi)<=d)
            {
                maxdist=max(maxdist,dist(lo,hi));
                if(lo-1>0&&dist(lo-1,hi)<=d)
                {
                    dp[lo][hi%2]+=dp[lo-1][hi%2];

                }
                if(hi-1>lo&&dist(lo,hi-1)<=d)
                {
                    dp[lo][hi%2]+=dp[lo][(hi-1)%2];

                }
                if(lo-1>0&&dist(lo-1,hi-1)<=d)
                {
                    dp[lo][hi%2]+=dp[lo-1][(hi-1)%2];
                }
                dp[lo][hi%2]%=mod;
            }
        }
    }
    cout<<maxdist<<" "<<dp[n][(n+1)%2]%mod;

}