#include <fstream>

using namespace std;
ifstream cin ("lapte.in");
ofstream cout ("lapte.out");
const int MINUSMCJOLLE = -1e9;
struct ura{
    int x, y;
};
ura v[105];
ura s[105];
int dp[105][105];
int rec[105][105];
int main()
{
    int n, t, st = 1, dr = 100, l, sol;
    cin >> n >> l;
    for (int i = 1; i <= n; i++)
        cin >> v[i].x >> v[i].y;
    while (st <= dr)
    {
        t = (st + dr) / 2;
        for (int i = 0; i <= n; i++)
            for (int j = 0; j <= l; j++)
                dp[i][j] = MINUSMCJOLLE;
        dp[0][0] = 0;
        for (int i = 1; i <= n; i++)
            for (int j = 0; j <= l; j++)
                for (int h = 0; h * v[i].x <= t && h <= j; h++)
                    dp[i][j] = max(dp[i][j], dp[i - 1][j -h] + (t - v[i].x * h) / v[i].y);
        if (dp[n][l] >= l)
        {
            sol = t;
            dr = t - 1;
        }
        else
            st = t + 1;
    }
    cout << sol;
    for (int i = 0; i <= n; i++)
        for (int j = 0; j <= l; j++)
            dp[i][j] = MINUSMCJOLLE;
    dp[0][0] = 0;
    for (int i = 1; i <= n; i++)
        for (int j = 0; j <= l; j++)
            for (int h = 0; h * v[i].x <= t && h <= j; h++)
            {
                if (dp[i][j] < dp[i - 1][j -h] + (t - v[i].x * h) / v[i].y)
                {
                    rec[i][j] = j - h;
                    dp[i][j] = max(dp[i][j], dp[i - 1][j -h] + (t - v[i].x * h) / v[i].y);
                }
            }
    for (int i = n; i > 0; i--)
    {
        s[i].x = l - rec[i][l];
        s[i].y = (sol - s[i].x * v[i].x) / v[i].y;
        l = rec[i][l];
    }
    for (int i = 1; i <= n; i++)
        cout << '\n' << s[i].x << " " << s[i].y;
    return 0;
}