#include <fstream>
#include <queue>
using namespace std;
ifstream cin("garaj.in");
ofstream cout("garaj.out");
const long long lim=1e5+3;
long long n,m,sum=0,maxim=0;
struct cam
{
    long long c,t;
}v[lim];
priority_queue<long long> pq;
int main()
{
    cin>>n>>m;
    for(long long i=1;i<=n;++i)
        cin>>v[i].c>>v[i].t,sum+=v[i].c,maxim=max(maxim,v[i].t);
    long long l=1,r=(m/sum+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/v[i].t)*v[i].c;
        if(tot<m)
            l=med+1;
        else r=med;
    }
    cout<<2*l<<' ';
    for(long long i=1;i<=n;++i)
        pq.push((l/v[i].t)*v[i].c);
    long long ans=0;
    while(m>0)
        m-=pq.top(),pq.pop(),++ans;
    cout<<ans;
    return 0;
}