#include <bits/stdc++.h>
 
using namespace std;
 
ifstream in("ghiozdan.in");
ofstream out("ghiozdan.out");
 
int n, wmax, eachWeight, we[205], ans[205], fweight, finalAns[205];
 
void clearOccurences(int &fweight) {
    for(int i = 1; i <= 200; i++) {
        ans[i] = 0;
    }
    fweight = wmax;
}
 
int main()
{
    in >> n >> wmax;
    for(int i = 1; i <= n; i++) {
        in >> eachWeight;
        we[eachWeight] += 1;
    }
 
    int minVal = n, maxCatPotSaIau = 0;
    for(int i = 200; i >= 1; i--) {
        if(we[i] == 0) continue;
 
        clearOccurences(fweight);
 
        int cat = 0, minim = 0;
        cat = min(we[i] * i, (fweight / i) * i );
        if(cat == 0) continue;
        fweight -= cat, minim += cat / i, ans[i] = cat / i;
 
        for(int j = i - 1; j >= 1; j--) {
            if(we[j] == 0) continue;
 
            cat = min(we[j] * j, (fweight / j) * j );
            if(fweight - cat >= 0 && cat != 0) {
                fweight -= cat;
                ans[j] = cat / j, minim += cat / j;
            }
        }
        if(wmax - fweight >= maxCatPotSaIau) {
            if(wmax - fweight > maxCatPotSaIau) {
                minVal = minim;
                for(int j = 1; j <= 200; j++) {
                    finalAns[j] = ans[j];
                }
            }
            maxCatPotSaIau = wmax - fweight;
            if(minVal > minim) {
                minVal = minim;
                for(int j = 1; j <= 200; j++) {
                    finalAns[j] = ans[j];
                }
            }
        }
    }
    int sum = 0;
    for(int i = 1; i <= 200; i++) {
        sum += finalAns[i] * i;
    }
    if(sum == 0) {
       out << "0 0";
       return 0;
    }
    out << sum << ' ' << minVal << '\n';
    for(int i = 1; i <= 200; i++) {
        if(finalAns[i]) {
            while(finalAns[i]--) {
                out << i << '\n';
            }
        }
    }
    return 0;
}