# include <fstream>
# include <iostream>
# include <algorithm>
# define DIM 100003
# define MAX 2000000000
using namespace std;
int n, m, C[DIM], T[DIM], t=MAX, N;

void read ()
{
	ifstream fin ("garaj.in");
	fin>>n>>m;
	for(int i=1;i<=n;++i) {
		fin>>C[i]>>T[i];
		T[i]*=2;
	}
}

void solve ()
{
	int c;
	for(int st = 1, dr = MAX, mij = (st+dr)>>1;st<=dr;mij=(st+dr)>>1) {
		c=0;
		for(int i=1;i<=n && c<m && mij>=T[i];++i)
			c+=mij/T[i]*C[i];
		if (c>=m) {
			dr = mij-1,
			t=min(mij, t);
		} else {
			st = mij+1;
		}
	}
	
	for(int i=1;i<=n;++i)
		T[i]=-(t/T[i]*C[i]);
		
	sort(T+1, T+n+1);
	c=0;
	for(N=0;N<n && c<m;++N) {
		c-=T[N+1];
	}
}

int main()
{
	read();
	solve();
	
	ofstream fout ("garaj.out");
	fout<<t<<" "<<N;
	
	return 0;
}