#include<cstdio>
#include<algorithm>
using namespace std;
int ras,S,i,n,m,s[100009],t[100009];
int a[100009];
int ok(int tmp)
{
    int i;
    int S=m;
    for(i=1;i<=n;i++)
    {
        S-=s[i]*(tmp/t[i]);
        if(S<=0) return 1;
    }
    return 0;
}
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]);
}
for(i=31;i>=0;i--)
    if(ok(ras+(1<<i)-1)==0)
        ras|=(1<<i);
printf("%d ",ras*2);
for(i=1;i<=n;i++)
    a[i]=1*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;
}