#include<cstdio>
#include<algorithm>
using namespace std;
int i,n,m,s[100009],t[100009];
long long S,p,u,mij,ras,a[100009];
int ok(long long tmp)
{
    long long S=0;
    for(i=1;i<=n;i++)
        S+=1LL*s[i]*(tmp/t[i]);
    return (S>=m);
}
int main()
{
freopen("garaj.in","r",stdin);
freopen("garaj.out","w",stdout);
scanf("%d",&n);
scanf("%d",&m);
for(i=1;i<=n;i++)
{
    scanf("%d",&s[i]);
    scanf("%d",&t[i]);
}
p=1;
u=1000000000000;
while(p<=u)
{
    mij=(p+u)>>1;
    if(ok(mij))
    {
        ras=mij;
        u=mij-1;
    }
    else p=mij+1;
}
printf("%lld ",ras*2);
for(i=1;i<=n;i++)
    a[i]=1LL*s[i]*(ras/t[i]);
sort(a+1,a+n+1);
reverse(a+1,a+n+1);
S=0;
for(i=1;i<=n;i++)
{
    S+=a[i];
    if(S>=m) break;
}
printf("%d\n",i);
return 0;
}