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