#include <fstream>
#include <vector>
#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,c,t,st=1005,dr=0;
long long sol[lim];
vector<long long> v[1005];
long long s[1005];
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>>t;
        sum+=c/t;
        add+=c;
        maxim=max(maxim,t);
        v[t].push_back(c);
        s[t]+=c;
        st=min(st,t);
        dr=max(dr,t);
    }
    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=st;i<=dr and tot<m;++i)
            tot+=(med/i)*s[i];
        if(tot<m)
            l=med+1;
        else r=med;
    }
    cout<<2*l<<' ';
    long long cnt=0;
    for(long long i=st;i<=dr;++i)
    for(long long j=0;j<v[i].size();++j)
        sol[++cnt]=(l/i)*v[i][j];
    sort(sol+1,sol+n+1,mycmp);
    long long ans=0;
    while(m>0) m-=sol[++ans];
    cout<<ans;
    return 0;
}