#include<cstdio>
    #include<cstring>
    using namespace std;
    #define MAX 105
    int N , L , sol , a[MAX] , b[MAX] , d[MAX][MAX] , c[MAX][MAX]  , cant[MAX];
    bool u[MAX][MAX] ;

    int main()
    {
        freopen("lapte.in" , "r" , stdin );
        freopen("lapte.out" , "w" , stdout );
        scanf("%d%d" , &N , &L );
        for(int i = 1 ; i <= N ; ++i )
            scanf("%d%d" , &a[i] , &b[i] );
        int ls = 1 , ld = 100 , T ;
        while(ls <= ld )
        {
            T = (ls+ld)/2;
            memset(d, 0 , sizeof(d));
            memset(c,0,sizeof(c));
            memset(u,0,sizeof(u));
            for(int i = 0 ; i <= T/a[1] ; ++i )
            {
                d[1][i] = (T-a[1]*i)/b[1];
                u[1][i] = 1;
                c[1][i] = i;
            }
            for(int i = 2 ; i <= N ; ++i )
                for(int j = 0 ; j <= L ; ++j )
                {
                    for(int k = 0 ; k <= j && T-a[i]*k >= 0; ++k )
                        if(u[i-1][j-k] && (T-a[i]*k)/b[i] + d[i-1][j-k] > d[i][j])
                    {
                        d[i][j] = (T-a[i]*k)/b[i] + d[i-1][j-k];
                        c[i][j] = k;
                        u[i][j] = 1;
                    }
                }
            if(d[N][L] >= L)
            {
                sol = T;
                int x = L;
                for(int i = N ; i ; i-- )
                {
                    cant[i] = c[i][x];
                    x -= c[i][x];
                }
                ld = T-1;
            }
            else ls = T+1;
        }
         printf("%d\n" , sol );
         for(int i = 1 ; i <= N ; ++i )
            printf("%d %d\n" , cant[i] , (sol-cant[i]*a[i])/b[i]);
         return 0;
    }