#include <fstream>
#include <cstring>
#include <algorithm>
#define INF 100000000


using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int n, i, l, j, k,st, dr, mid,aux;
int a[102], b[102], d[102][102];
pair<int, int> sol[102];


int verif(int t)
{
    int i, j, k, aux;
    for(i=0;i<=100;i++)
        for(j=0;j<=100;j++)
            d[i][j]=-INF;
    d[0][0]=0;
    for(i=1;i<=n;i++)
        for(j=0;j<=l;j++)
            for(k=0;k<=t/a[i]&&k<=j;k++)
            {
                aux=(t-k*a[i])/b[i];
                d[i][j]=max(d[i][j], d[i-1][j-k]+aux);
            }
    if(d[n][l]>=l)
        return 1;
    return 0;

}

int main()
{
    fin>>n>>l;
    for(i=1;i<=n;i++)
        fin>>a[i]>>b[i];
    st=1;
    dr=100;
    while(st<=dr)
    {
        mid=(st+dr)/2;
        if(verif(mid)==1)
            dr=mid-1;
        else
            st=mid+1;
    }
    fout<<st<<"\n";
    verif(st);
    for(i=n;i>=1;i--)
        for(k=0;k<=st/a[i];k++)
        {
            aux=(st-k*a[i])/b[i];
            if(d[i][l]==d[i-1][l-k]+aux)
            {
                sol[i].first=k;
                sol[i].second=aux;
                l-=k;
                break;
            }
        }
    for(i=1;i<=n;i++)
        fout<<sol[i].first<<" "<<sol[i].second<<"\n";
    return 0;
}