#include <cstdio>
#include <algorithm>
using namespace std;
#define fs first
#define sc second
#define mp make_pair
#define pii pair< int,int >
#define N 110

int n,l,t;
pii v[N];
int a[N][N];
int pre[N][N];

inline void citire() {
	scanf("%d%d",&n,&l);
	for(int i=1; i<=n; ++i)
		scanf("%d%d",&v[n-i+1].fs,&v[n-i+1].sc);
}

inline bool vezi() {
	for(int i=0; i<=l; ++i) {
		if(i*v[1].fs>t)
			a[1][i] = -1;
		else
			a[1][i] = (t-i*v[1].fs)/v[1].sc;
		pre[1][i] = -1;
	}

	int aux;
        for(int i=2; i<=n; ++i) {
		for(int j=0; j<=l; ++j) {
			a[i][j] = -1;
			pre[i][j] = -1;
			for(int w=0; w<=j; ++w) {
				if(a[i-1][j-w]==-1)
					continue;
				if(w*v[i].fs>t)
					continue;
				aux = a[i-1][j-w]+(t-w*v[i].fs)/v[i].sc;
				if(aux>a[i][j]) {
					a[i][j] = aux;
					pre[i][j] = j-w;
				}
			}
		}
	}

	if(a[n][l]<l)
		return false;
	return true;
}

inline void rezolva() {
	int p=1,u=20000;

	while(p<u) {
		t = (p+u)>>1;
		if(vezi())
			u = t;
		else
			p = t+1;
	}

	t = p;
}

inline void scrie() {
	printf("%d\n",t);
	vezi();
        int i=l;
        int n1 = n;

	while(i!=-1) {
		printf("%d %d\n",i-(pre[n1][i]>0 ? pre[n1][i] : 0),(t-(i-(pre[n1][i]>0 ? pre[n1][i] : 0))*v[n1].fs)/v[n1].sc);
		i = pre[n1][i];
		--n1;
	}
}

int main() {
	freopen("lapte.in","r",stdin);
	freopen("lapte.out","w",stdout);

	citire();
	rezolva();
	scrie();

	return 0;
}