#include <algorithm>
#include <vector>
using namespace std;

#define sc second
#define fs first
#define DIM 205

int best[DIM][3*DIM],cnt[DIM][3*DIM],viz[DIM][3*DIM],t[DIM][3*DIM];
pair <int,int> v[DIM],rez[DIM];
int n,l,nrc,sol;

void read ()
{
    int i;

    scanf ("%d%d",&n,&l);
    for (i=1; i<=n; ++i)
        scanf ("%d%d",&v[i].fs,&v[i].sc);
}

int check (int val)
{
    int i,j,k,a,b;

    memset (best,0,sizeof (best));
    memset (cnt,0,sizeof (cnt));
    memset (viz,0,sizeof (viz));
    memset (t,0,sizeof (t));
    for (i=1; i<=n; ++i)
    {
        for (j=0; j*v[i].fs<=val; ++j)
        {
            a=j;
            b=(val-j*v[i].fs)/v[i].sc;
            for (k=3*l; k>=0; --k)
                if (viz[i-1][k] && k+a<=2*l && best[i-1][k]+b>=best[i][k+a])
                {
					best[i][k+a]=best[i-1][k]+b;
					cnt[i][k+a]=a;
					viz[i][k+a]=1;
					t[i][k+a]=i-1;
				}
			if (best[i][a]<b || !viz[i][a])
            {
				best[i][a]=b;
				cnt[i][a]=a;
				viz[i][a]=1;
				t[i][a]=0;
            }
        }
        for (j=0; j<=3*l; ++j)
			if (best[i-1][j]>best[i][j] || (!viz[i][j] && viz[i-1][j]))
			{
			    best[i][j]=best[i-1][j];
				cnt[i][j]=cnt[i-1][j];
				viz[i][j]=1;
				t[i][j]=t[i-1][j];
			}
    }
    for (i=3*l; i>=l; --i)
		if (viz[n][i] && best[n][i]>=l)
		{
			nrc=i;
			return 1;
		}
	return 0;
}

void solve ()
{
    int i,nr,st,dr,mij;

    for (st=1, dr=sol=DIM; st<=dr; )
    {
        mij=(st+dr)/2;
        if (check (mij))
        {
            sol=mij;
            dr=mij-1;
        }
        else
            st=mij+1;
    }
    for (check (sol), i=n; i; i=t[i][nrc])
    {
        nr=cnt[i][nrc];
        rez[i].fs=nr;
        rez[i].sc=(sol-nr*v[i].fs)/v[i].sc;
        nrc-=nr;
    }
}

void print ()
{
    int i;

    printf ("%d\n",sol);
    for (i=1; i<=n; ++i)
        printf ("%d %d\n",rez[i].fs,rez[i].sc);
}

int main ()
{
    freopen ("lapte.in","r",stdin);
    freopen ("lapte.out","w",stdout);

    read ();
    solve ();
    print ();

    return 0;
}