#include <cstdio>

using namespace std;

char *Buffer;
int Best[75010];
int Ap[210];
int Prec[75010];

inline void read (int &X)
{
	X &= 0;
	
	while (*Buffer < '0' || *Buffer > '9')
		++ Buffer;
	
	while (*Buffer >= '0' && *Buffer <= '9')
		X = (X * 10) + (* (Buffer ++) - '0');
}

int main ()
{
	int N, G, i, j, k;
	long long fs;
	
	freopen ("ghiozdan.in", "r", stdin);
	freopen ("ghiozdan.out", "w", stdout);
	fseek (stdin, 0, SEEK_END);
	fs = ftell (stdin);
	Buffer = new char [fs];
	rewind (stdin);
	fread (Buffer, 1, fs, stdin);
	
	//in >> N >> G;
	read (N), read (G);
	
	for (i = 1; i <= N; i ++)
		read (j), ++ Ap[j];
	
	Best[0] = 1;
	
	for (i = 200; i; i --)
		if (Ap[i])
			for (j = G - i; j >= 0; j --)
				if (Best[j])
					for (k = 1; k <= Ap[i] && (j + i * k) <= G && !Best[j + i * k]; k ++)
						if (!Best[j + i * k]){
							Best[j + i * k] = Best[j] + k;
							Prec[j + i * k] = i;
						}
					
					
	for (i = G; !Best[i]; i --);
	
	//out << i << " " << Best[i] - 1 << "\n";
	printf ("%d %d\n", i, Best[i] - 1);
	while (i){
		//out << Prec[i] << "\n";
		printf ("%d\n", Prec[i]);
		i -= Prec[i];
	}
	
	return 0;
}