#include<stdio.h>
#include<algorithm>
using namespace std;
long n,s,i,j,v[20001],c[20001],u,si;
int main()
{
	freopen("ghiozdan.in","r",stdin);
	freopen("ghiozdan.out","w",stdout);
	scanf("%ld %ld",&n,&s);
	for (i=1;i<=n;i++)
		scanf("%ld",&v[i]);
	si=s;
	sort(v+1,v+n+1);
	for (i=n;i>=1;i--)
		if (v[i]<s)
		{
			s-=v[i];
			c[++u]=v[i];
		}
	printf("%ld %ld\n",si-s,u);
	for (i=u;i>=1;i--)
		printf("%ld\n",c[i]);
}