#include<fstream>
#include<vector>
#include<algorithm>
using namespace std;
int n,m,i,j;
pair<int,int> a[100001];
pair<int,int> res;
bool isrez(int mij,pair<int,int> &res)
{
	int nr=0,m1=0;
	for(i=0;i<n && m1<m;++i)
	{
		j=0;
		while(j+2*a[i].second<=mij && m1<m){j+=2*a[i].second;m1+=a[i].first;nr++;}
	}
	if(m1<m) return false;
	res.first=mij;
	res.second=nr;
	return true;
}

pair<int,int> b_search(int i,int j)
{
	if(i>j) return make_pair(0,0);
	pair<int,int> res;
	int mij=(i+j)/2;
	if(isrez(mij,res)){
		pair<int,int> res2;
		res2=b_search(i,mij-1);
		if(res2.first==0) return res;
		else return res2;}
	else
		return b_search(mij+1,j);

}
int main()
{
	ifstream f("garaj.in");
	ofstream g("garaj.out");
	f>>n>>m;
	for(i=0;i<n;++i)
		f>>a[i].first>>a[i].second;
	sort(&a[0],&a[n]);
	res=b_search(1,1000000);
	g<<res.first<<" "<<res.second<<endl;
	g.close();
}