#include <iostream>
#include <fstream>
#include <algorithm>
#define fin "lapte.in"
#define fou "lapte.out"
#define NMax 101
using namespace std;
ifstream t1(fin);
ofstream t2(fou);
int n,l,solok;

struct pct { int A,B,id; bool operator < (const pct &t) const { if(A-B < t.A-t.B) return true; return false; } } v[NMax];

struct pct2
{
    int A,B,id;

    bool operator < (const pct2 &t) const
    {
        if(id < t.id) return true;
        return false;
    }
} sol[NMax];

int beu(int t)
{
    long long canta=0,cantb=0,timp,ok=1,la,lb;
    int i;
    for(i=1;i<=n;i++)
    {
        timp=t; la=0; lb=0;
        if(canta<l)
        {
            if(l-canta>=timp/v[i].A) { canta+=timp/v[i].A; la+=timp/v[i].A; timp=timp%v[i].A; cantb+=timp/v[i].B; lb+=timp/v[i].B; }
            if(l-canta<timp/v[i].A) { timp-=(l-canta)*v[i].A; la+=l-canta; canta=l; cantb+=timp/v[i].B; lb+=timp/v[i].B; }
        }
        else { cantb+=timp/v[i].B; lb+=timp/v[i].B; }
        sol[i].A=la; sol[i].B=lb; sol[i].id=v[i].id;
    }
    if(cantb>=l) return 1;
    else return 0;
}

int main()
{
    t1>>n>>l;
    int i,m;
    for(i=1;i<=n;i++) { t1>>v[i].A>>v[i].B; v[i].id=i; }
    sort(v+1,v+n+1);
    int p=1,u=10000;
    while(p<u)
    {
        m=(p+u)/2;
        if(beu(m)==1) u=m-1;
        else p=m+1;
    }
    m=(p+u)/2;
     beu(m);
    m=m+1;
    t2<<m<<'\n';
    for(i=n;i>=1;i--) t2<<sol[i].A<<' '<<sol[i].B<<'\n';
    t1.close();
    t2.close();
    return 0;
}