#include<cstdio>
#include<algorithm>
using namespace std;
struct eu{long long x,y,z;};
eu v[100001];
long long i,j,n,m,k,l,l1,l2,mid;
bool sorting(eu a,eu b)
    {
    return a.z>b.z;
    }
int main ()
{
freopen("garaj.in","r",stdin);
freopen("garaj.out","w",stdout);
scanf("%lld%lld",&n,&m);
for(i=1;i<=n;i++)
    scanf("%lld%lld",&v[i].x,&v[i].y);
l2=1000000000000;
long long o=0;
while(l1<=l2)
    {
    mid=(l1+l2)/2;
    long long s=0;
    for(i=1;i<=n;i++)
        s=s+(mid/2/v[i].y)*v[i].x;
    if(s>m)
        {
        o=mid;
        l2=mid-1;
        }
    else
        l1=mid+1;
    }
printf("%lld ",o);
for(i=1;i<=n;i++)
    v[i].z=(o/2/v[i].y)*v[i].x;
sort(v+1,v+n+1,sorting);
long long s=0;
for(i=1;i<=n;i++)
    {
    s+=v[i].z;
    if(s>=m)
        {
        printf("%lld",i);
        break;
        }
    }
return 0;
}