#include <bits/stdc++.h>
using namespace std;
struct dd
{
    int st=0;
    int x,y;
};
dd dp[100005];
vector<int>v;
void dfs(int poz)
{
    if(poz==0)return ;
    for(int i=1;i<=dp[poz].y;++i)v.push_back(dp[poz].x);
    dfs(poz-dp[poz].x);
}
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]++;
    }
    for(i=4;i>=1;--i)
    {
     int nr;
     nr=i;
     if(fr[nr]==0)continue;
     int t;
     for(t=1;t<=fr[nr];++t)
     {nr=t*i;
     for(j=g-nr;j>=0;--j)
     {
        if(dp[j].st)
            {
                if(dp[j+nr].st==0)
                {
                    dp[j+nr].st=dp[j].st+t;
                    dp[j+nr].x=i;dp[j+nr].y=t;
                    if(j+nr>m1)
                    {
                        v.clear();
                        m1=j+nr;
                        dfs(m1);
                    }
                    continue;
                }
                if(dp[j+nr].st>(dp[j].st+t))
                {
                    dp[j+nr].st=dp[j].st+t;
                   dp[j+nr].x=i;dp[j+nr].y=t;
                                        if(j+nr>=m1)
                    {
                        v.clear();
                        m1=j+nr;
                        dfs(m1);
                    }
                    continue;
                }
                continue;
            }
        if(j==0)
        {
                            if(dp[j+nr].st==0)
                {
                    dp[j+nr].st=dp[j].st+t;
                    dp[j+nr].x=i;dp[j+nr].y=t;
                                        if(j+nr>=m1)
                    {
                        v.clear();
                        m1=j+nr;

                        dfs(m1);
                    }
                    continue;
                }
                if(dp[j+nr].st>(dp[j].st+t))
                {
                    dp[j+nr].st=dp[j].st+t;
                    dp[j+nr].x=i;dp[j+nr].y=t;
                                        if(j+nr>=m1)
                    {
                        v.clear();
                        m1=j+nr;

                        dfs(m1);
                    }
                    continue;
                }
        }
     }
     }
    }
    for(j=g;j>=1;j--){if(dp[j].st){printf("%d %d\n",j,dp[j].st);break;}}
    vector<int>::iterator it;
    for(it=v.begin();it!=v.end();it++)
        printf("%d\n",*it);
    return 0;
}