#include<cstdio>
#include<algorithm>
using namespace std;
int n,nr,s,maxi,gm,i,l1,l,j,a[20002],b[75002],ap[75002];
int main()
{
freopen("ghiozdan.in","r",stdin);
freopen("ghiozdan.out","w",stdout);
scanf("%d",&n);
scanf("%d",&gm);
l=1;
b[1]=0;
ap[0]=-1;
for(i=1;i<=n;i++)
	scanf("%d",&a[i]);
sort(a+1,a+n+1);
for(i=n;i>=1;i--)
{
	l1=l;
	for(j=1;j<=l1;j++)
		if(b[j]+a[i]<=gm&&ap[b[j]+a[i]]==0)
		{
			ap[b[j]+a[i]]=i;
			if(b[j]+a[i]>maxi) maxi=b[j]+a[i];
			l++;
			b[l]=b[j]+a[i];
		}
}
printf("%d ",maxi);
nr=0;
s=maxi;
while(1)
{
	if(s==0) break;
	nr++;
	b[nr]=a[ap[s]];
	s=s-a[ap[s]];
}
//sort(b+1,b+nr+1);
printf("%d\n",nr);
for(i=1;i<=nr;i++)
	printf("%d\n",b[i]);
return 0;
}