#include <bits/stdc++.h>
using namespace std;
struct dd
{
    int st=0;
    int x,y;
};
dd dp[100005];
vector<int>v;
int fr[205];
int main()
{
    freopen("ghiozdan.in","r",stdin);
    freopen("ghiozdan.out","w",stdout);
    int n,g,i,j,k;
    scanf("%d%d",&n,&g);
    int m1=0;
    for(i=1;i<=n;++i)
    {
        int nr;
        scanf("%d",&nr);
        fr[nr]++;
    }
    int cnt=0;
    for(i=200;i>=1;--i)
{
     int nr;
     nr=i;
     if(fr[nr]==0)continue;
     cnt++;
     int t;
     for(j=g-i;j>=0;--j)
     {
        if(dp[j].st)
            {
                t=1;
                while(t<=fr[i])
                {
                    nr=t*i;
                    int t1=t;
                    t++;
                    if(j+nr>g)break;
                    if(dp[j+nr].st==0)
                {
                    dp[j+nr].st=dp[j].st+t1;
                    dp[j+nr].x=i;dp[j+nr].y=t1;
                    if(j+nr>m1)
                    {
                                m1=j+nr;
                    }
                    continue;
                }
                if(dp[j+nr].st>(dp[j].st+t1))
                {
                    dp[j+nr].st=dp[j].st+t1;
                   dp[j+nr].x=i;dp[j+nr].y=t1;
                                        if(j+nr>=m1)
                    {
                        m1=j+nr;
                    }
                    continue;
                }
                }
                continue;
            }
        if(j==0)
        {
            t=1;
            while(t<=fr[i])
            {
                nr=t*i;
                t++;
                int t1=t-1;
                if(j+nr>g)break;
                            if(dp[j+nr].st==0)
                {
                    dp[j+nr].st=dp[j].st+t1;
                    dp[j+nr].x=i;dp[j+nr].y=t1;
                                        if(j+nr>=m1)
                        m1=j+nr;
                    continue;
                }
                if(dp[j+nr].st>(dp[j].st+t1))
                {
                    dp[j+nr].st=dp[j].st+t1;
                    dp[j+nr].x=i;dp[j+nr].y=t1;
                                        if(j+nr>=m1)
                        m1=j+nr;
                    continue;
                }
        }
        }
     }
    }
    printf("%d %d\n",m1,dp[m1].st);
    while(m1)
    {
        for(i=1;i<=dp[m1].y;++i)printf("%d\n",dp[m1].x);
        m1-=dp[m1].x*dp[m1].y;
    }
    return 0;
}