#include<cstdio>
#include<algorithm>
using namespace std;
int n,l,di[105][105],a[105],b[105],aa[105][105],ab[105][105],sa[105],sb[105];
bool verif(int ti)
{
int i,j,x;
for(i=0;i<=n;i++)
for(j=0;j<=l;j++)
di[i][j]=-1;
di[0][0]=0;
for(i=1;i<=n;i++)
for(j=l;j>=0;j--)
for(x=ti/a[i];x>=0;x--)
if(di[i-1][j]>=0)
{
{
    if(j+x<=l)
    {
        if(di[i][j+x]<di[i-1][j]+(ti-x*a[i])/b[i])
        {
           di[i][j+x]=di[i-1][j]+(ti-x*a[i])/b[i];
           aa[i][j+x]=x;
           ab[i][j+x]=(ti-x*a[i])/b[i];
        }
    }
}
}
if(di[n][l]>=l)
return 1;
else
return 0;
}
int main()
{
    freopen("lapte.in","r",stdin);
    freopen("lapte.out","w",stdout);
    int m,i,j,st,dr,ti,tan,ca,cb,x;
    scanf("%d%d",&n,&l);
    for(i=1;i<=n;i++)
    scanf("%d%d",&a[i],&b[i]);
    st=1;
    dr=20000;
    while(st<=dr)
    {
        ti=(st+dr)/2;
        if(verif(ti))
        {
            tan=ti;
            dr=ti-1;
        }
        else
        st=ti+1;
    }
    verif(tan);
    printf("%d\n",tan);
    x=l;
    for(i=n;i>=1;i--)
    {
       sa[i]=aa[i][x];
       sb[i]=ab[i][x];
       x=x-sa[i];
    }
    for(i=1;i<=n;i++)
    printf("%d %d\n",sa[i],sb[i]);
    return 0;
}