#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("garaj.in");
ofstream cout("garaj.out");
const long long lim=1e5+3;
long long n,m,sum=0,add=0,maxim=0;
long long c[lim];
long long t[lim];
bool mycmp(long long a,long long b)
{return a>b;}
int main()
{
    cin>>n>>m;
    for(long long i=1;i<=n;++i)
        cin>>c[i]>>t[i],sum+=c[i]/t[i],add+=c[i],maxim=max(maxim,t[i]);
    long long l=m/(sum+n),r=(m/add+1)*maxim,med;
    while(l<r)
    {
        med=(l+r)/2;
        long long tot=0;
        for(long long i=1;i<=n and tot<m;++i)
            tot+=(med/t[i])*c[i];
        if(tot<m)
            l=med+1;
        else r=med;
    }
    cout<<2*l<<' ';
    for(long long i=1;i<=n;++i)
        c[i]=(l/t[i])*c[i];
    sort(c+1,c+n+1,mycmp);
    long long ans=0;
    while(m>0) m-=c[++ans];
    cout<<ans;
    return 0;
}