#include<cstdio>
#include<algorithm>
#define oo (1<<31)-1
using namespace std;
int A[75010],n,G,i,j,g;
int main()
{
    freopen("ghiozdan.in","r",stdin);
    freopen("ghiozdan.out","w",stdout);
    scanf("%d%d",&n,&G);
    for(i=1;i<=G;i++) A[i]=oo;
    for(i=1;i<=n;i++)
    {
        scanf("%d",&g);
        if(g>G) continue;
        for(j=G;j>=g;j--)
            if(A[j-g]!=oo) A[j]=min(A[j],A[j-g]+1);
        A[g]=1;
    }
    for(i=G;i>=1;i--)
        if(A[i]!=oo) {printf("%d %d\n",i,A[i]);break;}
    return 0;
}