#include<bits/stdc++.h>
#define maxN 100005
using namespace std;
long long n,x,st,dr,sol,mid,timp,nr,val;
pair<long long,long long> v[maxN];
bool cmp(pair<long long,long long> a,pair<long long, long long> b)
{
    double x=((1.0)*a.first)/a.second;
    double y=((1.0)*b.first)/b.second;
    return x>y;
}
int main()
{
    freopen("garaj.in","r",stdin);
    freopen("garaj.out","w",stdout);
    scanf("%lld%lld",&n,&x);
    for(int i=1;i<=n;i++)
    {
        scanf("%lld%lld",&v[i].first,&v[i].second);
    }
    st=0LL;
    dr=INT_MAX;
    while(st<=dr)
    {
        long long mid=(st+dr)>>1;
        long long val=1LL;
        for(long long i=1;i<=n;i++)
        {
            val=val+(1LL*v[i].first)*(1LL*(mid/(2LL*v[i].second)));
        }
        if(val>=x)
        {
            sol=mid;
            dr=mid-1LL;
        }
            else st=mid+1LL;
    }
    printf("%lld ",sol);
    timp=sol;
    sort(v+1,v+n+1,cmp);
    for(long long i=1;i<=n;i++)
    {
        nr+=1LL;
        val=v[i].first*(timp/(2LL*v[i].second));
        if(val<=x)
        {
            x-=val;
        }
            else break;
    }
    printf("%lld\n",nr);
    return 0;
}