#include<fstream>
using namespace std;
ifstream f("lapte.in");
ofstream g("lapte.out");
int n, i, l, a[103], b[103], st, dr, j, t, k, d[103][103];
pair<int, int> sol[103];
int main()
{
    f>>n>>l;
    for(i=1;i<=n;i++)
        f>>a[i]>>b[i];
    st=1;
    dr=100;
    while(st<=dr)
    {
        t=(st+dr)/2;
        for(i=1;i<=n;i++)
            for(j=1;j<=n;j++)
                d[i][j]=0;
        for(i=1;i<=n;i++)
            for(j=0;j<=l;j++)
                for(k=0;k<=t/a[i] && k<=j;k++)
                {
                    int x=(t-k*a[i])/b[i];
                    if(d[i][j]<d[i-1][j-k]+x)
                    {
                        d[i][j]=d[i-1][j-k]+x;
                        sol[i].first=k;
                        sol[i].second=x;
                    }
                    //else
                }
        if(d[n][l]>=l)
            dr=t-1;
        else st=t+1;
    }
    g<<t<<"\n";
    for(i=1;i<=n;i++)
        g<<sol[i].first<<" "<<sol[i].second<<"\n";
    return 0;
}