#include <cstdio>
#include <algorithm>

using namespace std;

long long st,dr,mj;
int c[100005],t[100005],i,m,n,v[100005],nr=0;

bool Ok(long long T)
{
    int i,nr=0;
    for(i=1;i<=n;++i)
    {
        nr+=(int)(c[i]*(T/t[i]));
        if(nr>=m) return 1;
    }
    return 0;
}
int main()
{
    freopen("garaj.in","r",stdin);
    freopen("garaj.out","w",stdout);

    scanf("%d%d",&n,&m);
    for(i=1;i<=n;++i) scanf("%d%d",&c[i],&t[i]);

    st=1LL;dr=1000000000001LL;

    while(st<=dr)
    {
        mj=(st+dr)>>1LL;
        if(Ok(mj)) dr=mj-1;
        else st=mj+1;
    }
    printf("%lld ",2*st);
    for(i=1;i<=n;++i)
    v[i]=(int)(c[i]*(st/t[i]));

    sort(v+1,v+n+1);
    for(i=n;i;--i)
    {
       nr+=v[i];
       if(nr>=m) break;
    }
    printf("%d\n",n-i+1);

    return 0;
}