#include <iostream>
#include <vector>
#include <algorithm>
#include <limits>
#include <numeric>
#include <cstring>
#include <string>
#include <queue>
#include <set>
#include <fstream>
#define pb push_back
#define mp make_pair
#define INF numeric_limits<int>::max()
#define bit(x) (-x)&x
#define int64 long long
using namespace std;
ifstream in("garaj.in");
ofstream out("garaj.out");
int n,s,d[100010];
pair<int,int> a[100010];
#define c first
#define t second
int64 cnt(int t)
{
    int64 nr=0;
    for(int i=1;i<=n;i++)
    {
        nr+=t/a[i].t*1LL*a[i].c;
        if(nr>=s)break;
    }
    return nr;
}
int main()
{
    in>>n>>s;
    for(int i=1;i<=n;i++)
    {
        in>>a[i].c>>a[i].t;
        a[i].t*=2;
    }
    int left=1,right=INF;
    while(left<=right)
    {
        int64 mid=(left+right)/2;
        if(cnt(mid)<s)left=mid+1;
        else right=mid-1;
    }
    int sol=left;
    for(int i=1;i<=n;i++)
        d[i]=sol/a[i].t*1LL*a[i].c;
    sort(d+1,d+n+1);
    int k=1;
    for(int i=n;s>0 && i;i--)
    {
        s-=d[i];
        if(s>0)
            k++;
    }
    out<<sol<<' '<<k<<'\n';
	return 0;
}