#include <cstring>
#include <fstream>
#include <algorithm>

using namespace std;

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

const int INF = 0x3ff3f3f;

int N, L;
int A[102], B[102];
int maxA[102][102], Tat[102][102];
int rmaxA[102][102], rTat[102][102];

bool Test(int x)
{
    memset(maxA, -1, sizeof(maxA));

    maxA[0][0] = 0;
    for (int i = 1; i <= N; ++i)
        for (int j = 1; j <= L; ++j)
            for (int k = 0; k <= x / B[i] && k <= j; ++k)
                if (maxA[i - 1][j - k] != -1 && maxA[i - 1][j - k] + (x - k * B[i]) / A[i] > maxA[i][j])
                {
                    maxA[i][j] = maxA[i - 1][j - k] + (x - k * B[i]) / A[i];
                    Tat[i][j] = j - k;
                }

    if (maxA[N][L] >= L)
    {
        memcpy(rmaxA, maxA, sizeof(maxA));
        memcpy(rTat, Tat, sizeof(Tat));
        return true;
    }
    return false;
}
void reconst(int i, int j)
{
    if (i == 0) return;
    reconst(i - 1, rTat[i][j]);
    fout << rmaxA[i][j] - rmaxA[i - 1][rTat[i][j]] << ' ' << j - rTat[i][j] << '\n';
}

int main()
{
    fin >> N >> L;
    for (int i = 1; i <= N; ++i)
        fin >> A[i] >> B[i];

    int step, result;
    for (step = 1; (step << 1) <= 100000; step <<= 1);
    for (result = step + 1; step; step >>= 1)
        if (result - step >= 1 && Test(result - step))
            result -= step;

    fout << result << '\n';
    reconst(N, L);

    fin.close();
    fout.close();
}