#include <bits/stdc++.h>
using namespace std;
void debug_out() { cerr << endl; }
template<class T> ostream& prnt(ostream& out, T v) { out << v.size() << '\n'; for(auto e : v) out << e << ' '; return out;}
template<class T> ostream& operator<<(ostream& out, vector <T> v) { return prnt(out, v); }
template<class T> ostream& operator<<(ostream& out, set <T> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, map <T1, T2> v) { return prnt(out, v); }
template<class T1, class T2> ostream& operator<<(ostream& out, pair<T1, T2> p) { return out << '(' << p.first << ' ' << p.second << ')'; }
template <typename Head, typename... Tail> void debug_out(Head H, Tail... T) { cerr << " " << H; debug_out(T...);}
#define dbg(...) cerr << #__VA_ARGS__ << " ->", debug_out(__VA_ARGS__)
#define dbg_v(x, n) do{cerr<<#x"[]: ";for(int _=0;_<n;++_)cerr<<x[_]<<" ";cerr<<'\n';}while(0)
#define dbg_ok cerr<<"OK!\n"
#define ll long long
#define ld long double
#define ull unsigned long long
#define pii pair<int,int>
#define MOD 1000000007
#define zeros(x) x&(x-1)^x
#define fi first
#define se second
#define Nmax 105
const long double PI = acos(-1);

int n,l,DP[Nmax][Nmax];

struct bautor{
	int a, b, pos;
	bool operator<(const bautor &oth) const{
		return a - b < oth.a - oth.b;
	}
}B[Nmax],sol[Nmax];

int a[Nmax], b[Nmax];
bool OK(int t){
	memset(a,0,sizeof a);
	memset(b,0,sizeof b);
	for (int i=1;i<=n;i++){
		a[i] += a[i-1] + t / B[i].a;
	}
	for (int i=n;i>=1;i--){
		sol[B[i].pos].a = 0;
		sol[B[i].pos].b = t / B[i].b;
		b[i] += b[i+1] + t / B[i].b;
	}

	for (int i=1;i<=n;i++){
		int crtA = a[i-1];
		int crtB = b[i+1];
		int need = max(0,(l-crtA)) * B[i].a + max(0,(l-crtB)) * B[i].b;
		// dbg(t,i,need,crtA,crtB);
		sol[B[i].pos].b = max(0,l-crtB);
		sol[B[i].pos].a = max(0,l-crtA);

		if (need <= t){
			// dbg(i,t,crtA,crtB);
			return 1;
		}

		sol[B[i].pos].a = t / B[i].a;
		sol[B[i].pos].b = 0;
	}
	// dbg(t);
	return 0;
}

int main(){
  ios::sync_with_stdio(false);
 	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",&B[i].a, &B[i].b);
 		B[i].pos = i;
 	}

 	sort(B+1,B+n+1);

 	int p = 1, st = 0;
 	for (;p<=20000;p<<=1);
 	for (;p>=1;p>>=1){
 		if (!OK(st+p))
 			st+=p;
 	}

 	if (!OK(st))
 		st++;
 	OK(st);

 	printf("%d\n",st);
 	for (int i=1;i<=n;i++){
 		printf("%d %d\n",sol[i].a,sol[i].b);
 	}

  return 0;
}