#include <fstream>

using namespace std;

ifstream in("lapte.in");
ofstream out("lapte.out");

struct om {
    int a,b;
};

om v[103], sol[103], sol_fin[103];
int indici[103];

int n,t,l;

void sortare() {
    om aux;
    int sortat;
    int auxi;
    double rap1, rap2;
    do {
        sortat = 1;
        for (int i = 0; i < n - 1; i++) {
            rap1 = v[i].a * v[i + 1].b;
            rap2 = v[i + 1].a * v[i].b;
            if (rap1 > rap2) {
                aux = v[i];
                v[i] = v[i + 1];
                v[i + 1] = aux;
                sortat = 0;
                auxi = indici[i];
                indici[i] = indici[i + 1];
                indici[i + 1] = auxi;
            }
        }
    } while (!sortat);
}

int solutie(int timp) {
    int A = 0, B = 0;
    int lapte, temp;
    int sw = n;
    for (int i = 0; i < n; i++) {
        sol[i].a = sol[i].b = 0;
    }

    for (int i = 0; i < n; i++) {
        lapte = timp / v[i].a;
        sol[indici[i]].a = min(lapte, l - A);
        A+=sol[indici[i]].a;
        if (sol[indici[i]].a * v[i].a > timp)
            return 0;
    }

    for (int i = n - 1; i >= 0; i--) {
        lapte = timp / v[i].b;
        sol[indici[i]].b = min(lapte, l - B);
        B+=sol[indici[i]].b;
        if (sol[indici[i]].b * v[i].b + sol[indici[i]].a * v[i].a> timp)
            return 0;
    }


    if (A>=l && B>=l)
        return 1;
    return 0;
}


void copiere() {
    for (int i = 0; i < n; i++)
        sol_fin[i] = sol[i];
}

void cautare_binara(int st, int dr) {
    if (st > dr)
        return;
    int m = (st + dr) / 2;
    if (!solutie(m))
        cautare_binara(m + 1, dr);
    else {
            t = m;
            cautare_binara(st, m - 1);
        }
}

int main() {
    in>>n>>l;

    for (int i = 0; i < n; i++) {
        in>>v[i].a>>v[i].b;
        indici[i] = i;
    }

    sortare();

    cautare_binara(1,l*100*100);

    solutie(t);
    out<<t<<"\n";
    for (int i = 0; i < n; i++) {
        out<<sol[i].a<<" "<<sol[i].b<<"\n";
    }
    return 0;
}