#include<bits/stdc++.h>
#define maxN 100005
using namespace std;
int n,x,st,dr,sol,mid,timp,nr,val,a[maxN];
pair<int,int> v[maxN];
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=INT_MAX;
    while(st<=dr)
    {
        int mid=(st+dr)>>1;
        long long val=1LL;
        for(int i=1;i<=n;i++)
        {
            val=val+(1LL*v[i].first)*(1LL*(mid/(2*v[i].second)));
        }
        if(val>=x)
        {
            sol=mid;
            dr=mid-1;
        }
            else st=mid+1;
    }
    printf("%d ",sol);
    timp=sol;
    for(int i=1;i<=n;i++)
    {
        a[i]=v[i].first*((timp)/(2*v[i].second));
    }
    sort(a+1,a+n+1);
    for(int i=n;i>=1 && x>0;i--)
    {
        nr++;
        x-=a[i];
    }
    printf("%d\n",nr);
    return 0;
}