#include <fstream>
#include <vector>
using namespace std;
ifstream cin("lapte.in");
ofstream cout("lapte.out");
const int NMAX = 105;
int n, L, dp[NMAX][NMAX];
vector<int> t1, t2;

bool simulate(int tmax){
    for(int i=0; i<NMAX; i++)
        for(int a=0; a<NMAX; a++)
            dp[i][a] = -1;
    
    dp[0][0] = 0;

    for(int i=1; i<=n; i++){
        for(int A=0; A<=L; A++){
            for(int a=0; a<=A and a * t1[i] <= tmax; a++){
                if(dp[i-1][A-a] == -1)
                    continue;

                int b = (tmax - a * t1[i]) / t2[i];
                dp[i][A] = max(dp[i][A], dp[i-1][A-a] + b);
            }
        }
    }

    return (dp[n][L] >= L);
}

void traceback(const int t, int i, const int cant){
    if(!i)
        return;

    for(int a=0; a<=cant; a++){
        int tb = t - a * t1[i];
        if(dp[i][cant] == dp[i-1][cant-a] + tb / t2[i]){
            traceback(t, i-1, cant - a);
            cout<<a<<" "<<tb / t2[i]<<'\n';
            break;
        }
    }
}
int main(){
    cin>>n>>L;

    t1.resize(n+1);
    t2.resize(n+1);
    for(int i=1; i<=n; i++){
        cin>>t1[i]>>t2[i];
    }

    int l=1, r = 210, sol=-1;
    while(l <= r){
        int mid = (l + r) / 2;
        bool is_possible = simulate(mid);

        if(is_possible)
            sol = mid, r = mid - 1;
        
        else l = mid + 1;
    }

    cout<<sol<<'\n';

    traceback(sol, n, L);
    
    return 0;
}