#include<cstdio>
#include<algorithm>
using namespace std;
struct eu{int x,y;};
eu v[100001];
int l1,l2,mid;
int i,j,n,m,k,l;
bool s1(eu a,eu b)
    {
    return a.x*b.y>b.x*a.y;
    }
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",&v[i].x,&v[i].y);
sort(v+1,v+n+1,s1);
l1=1;
l2=1000000000;
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)
            break;
        }
    if(s>=m)
        {
        o=mid;
        l2=mid-1;
        }
    else
        l1=mid+1;
    }
printf("%lld ",o);
for(i=1;i<=n;i++)
    v[i].x=o/(2*v[i].y)*v[i].x;
long long s=0;
for(i=1;i<=n;i++)
    {
    s+=v[i].x;
    if(s>=m)
        {
        printf("%d",i);
        break;
        }
    }
return 0;
}