#include<bits/stdc++.h>

using namespace std;

typedef struct lol
{
    int x,y;
}troll;

int i,st=1,dr=1e4,n,L,a[105],b[105],dp[105][105],aux[105][105],ans;
troll rs[105];

bool Check(int x)
{
    int i,j,k;
    for(i=0;i<=n;++i)
        for(j=0;j<=L;++j)
            dp[i][j]=-1e9,aux[i][j]=0;
    for(dp[0][0]=0,i=1;i<=n;++i)
        for(j=0;j<=L;++j)
            for(k=0;k<=j;++k)
                if(x-a[i]*(j-k)>=0 && dp[i][j]<dp[i-1][k]+(x-a[i]*(j-k))/b[i])
                    dp[i][j]=dp[i-1][k]+(x-a[i]*(j-k))/b[i],aux[i][j]=k;
    return dp[n][L]>=L;
}

void GetSolution(int x)
{
    Check(ans);
    for(int i=n,j=L,k=0;i;--i,j=k)
        k=aux[i][j],rs[i].x=j-k,rs[i].y=dp[i][j]-dp[i-1][k];
}

int main()
{
    ifstream cin("lapte.in");
    ofstream cout("lapte.out");
    ios_base::sync_with_stdio(0); cin.tie(0);
    cin>>n>>L;
    for(i=1;i<=n;++i)
        cin>>a[i]>>b[i];
    while(st<=dr)
    {
        int pivot=(st+dr)/2;
        if(Check(pivot)) ans=pivot,dr=pivot-1;
        else st=pivot+1;
    }
    cout<<ans<<'\n';
    GetSolution(ans);
    for(i=1;i<=n;++i) cout<<rs[i].x<<' '<<rs[i].y<<'\n';
    return 0;
}