using namespace std;

#include <set>
#include <map>
#include <list>
#include <deque>
#include <stack>
#include <queue>
#include <cmath>
#include <ctime>
#include <cctype>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <utility>
#include <iomanip>
#include <fstream>
#include <cstring>
#include <sstream>
#include <iostream>
#include <algorithm>
#include <functional>

#define oo (1<<30)
#define f first
#define s second
#define II inline
#define db double
#define ll long long
#define pb push_back
#define mp make_pair
#define Size(V) ((int)(V.size()))
#define all(v) v.begin() , v.end()
#define CC(v) memset((v),0,sizeof((v)))
#define CP(v,w) memcpy((v),(w),sizeof((w)))
#define FOR(i,a,b) for(int (i)=(a);(i)<=(b);++(i))
#define REP(i, N) for (int (i)=0;(i)<(int)(N);++(i))
#define FORit(it, x) for (__typeof((x).begin()) it = (x).begin(); it != (x).end(); ++it)

#define IN "ghiozdan.in"
#define OUT "ghiozdan.out"
#define G_MAX (1<<17)

typedef vector<int> VI;
typedef pair<int,int> pi;
typedef vector<string> VS;
template<class T> string toString(T n) {ostringstream ost;ost<<n;ost.flush();return ost.str();}

int N,G;
int C[G_MAX],Sol[G_MAX],Nr[222];

II void scan()
{
	freopen(IN,"r",stdin);
	freopen(OUT,"w",stdout);
	scanf("%d%d",&N,&G);
	
	int x;
	FOR(i,1,N)
	{
		scanf("%d",&x);
		++Nr[x];
	}
}

II void solve()
{
	C[0] = 1;
	
	for(int i = 200;i >= 1;--i)
	for(int j = G - i;j >= 0;--j)
	{
		if(!C[j])
			continue;
		
		FOR(k,1,Nr[i])
			if(j + k * i <= G && !C[j + k * i])
			{
				C[j + k * i] = C[j + (k - 1) * i] + 1;
				Sol[j + k * i] = j + (k - 1) * i;
			}
			else 
				break;				
	}
	for(;!C[G];--G);
	
	printf("%d %d\n",G,--C[G]);
	
	int x = G,y = Sol[G];
	
	FOR(i,1,C[G])
	{
		printf("%d\n",x - y);
		x = y;
		y = Sol[x];
	}
}	

int main()
{
	scan();
	solve();
	return 0;
}