#include <bits/stdc++.h>

using namespace std;
ifstream fin("lapte.in");
ofstream fout("lapte.out");
int n, need;

struct Iris {
    int a, b, idx;
}v[103], temp[103], good[103];

inline int cmp(Iris a, Iris b) { return a.a - a.b < b.a - b.b; }

inline int check(int x) {
    for(int i=1; i<=n; i++) temp[i] = {0, 0};
    int a = 0, b = 0;
    for(int i=1; i<=n; i++) {
        if(a < need) { ///pun in a
            int canTake = x / v[i].a;
            int take = max(0, min(canTake, need - a));
            a += take, temp[v[i].idx].a = take;
            ///incerc sa pun si in b
            int rest = x - take * v[i].a;
            canTake = rest / v[i].b;
            take = max(0, min(canTake, need - b));
            b += take, temp[v[i].idx].b = take;
        }
        else { ///am terminat a pun in b
            int canTake = x / v[i].b;
            int take = max(0, min(canTake, need - b));
            b += take, temp[v[i].idx].b = take;
        }
    }
    return a >= need && b >= need;
}

int main()
{
    fin >> n >> need;
    for(int i=1; i<=n; i++) fin >> v[i].a >> v[i].b, v[i].idx = i;
    sort(v+1, v+n+1, cmp);
    int st = 1, dr = 1e5, sol;
    while(st <= dr) {
        int mid = (st + dr) / 2;
        if(check(mid)) {
            sol = mid, dr = mid - 1;
            for(int i=1; i<=n; i++) good[i] = temp[i];
        }
        else st = mid + 1;
    }
    fout << sol << '\n';
    for(int i=1; i<=n; i++) fout << good[i].a << " " << good[i].b << '\n';

    return 0;
}