#include <bits/stdc++.h>
using namespace std;

int n, g, a[210], dp[2][75005], ap[75005];
bool u;

int main(){
    ifstream cin ("ghiozdan.in");
    ofstream cout ("ghiozdan.out");
    cin >> n >> g;
    for (int i=1, x; i<=n; i++) cin >> x, a[x]++;
    dp[0][0] = dp[1][0] = 1;
    for (int i=200; i; i--){
        if (!a[i]) continue;
        for (int j=1; j<=g; j++) dp[u][j] = dp[!u][j];
        for (int j=g; j>=0; j--){
            if (dp[!u][j]){
                for (int d=1; d<=a[i] && j+d*i <= g && !dp[u][j + d*i]; d++)
                    dp[u][j+d*i] = dp[!u][j] + d, ap[j+d*i] = i;
            }
            //if (dp[!u][j - min(j/i, a[i])*i] + min(j/i, a[i]) < dp[u][j]) dp[u][j] = dp[!u][j - min(j/i, a[i])*i] + min(j/i, a[i]), ap[j] = i;
        }
        u = !u;
    }
    int j = g;
    while (j && !dp[!u][j]) j--;
    cout << j << " " << dp[!u][j]-1 << "\n";
    while (j>0){
        cout << ap[j] << "\n";
        j -= ap[j];
    }
    return 0;
}