#include <fstream>
#include <algorithm>
using namespace std;

ifstream f("ghiozdan.in");
ofstream g("ghiozdan.out");

int G,N,a[20001],i,gmax,nmin,b[20001];
int main()
{
    f>>N>>G;
    for(i=1;i<=N;i++)
        f>>a[i];
    sort(a+1,a+N+1);
    while(gmax<=G)
    {
        for(i=N;i>=1;i--)
            gmax=gmax+a[i];
            b[i]=gmax;
            nmin++;
    }
    g<<gmax<<nmin<<"\n";
    for(i=1;i<=N;i++)
        g<<b[i]<<"\n";
}