#include<cstdio>
#include<algorithm>
using namespace std;
struct camion
{
    int c,t;
} a[100005];
int n,m,st,dr,mij,Tmin,Nrmin;
bool timp(int T)
{
    int i,k=m;
    for (i=1;i<=n && k>0;++i)
        k-=a[i].c*(T/(2*a[i].t));
    if (k<=0) return true;
    else return false;
}
bool cmp(camion A, camion B)
{
    return ((double)A.c/A.t>(double)B.c/B.t);
}
int main()
{
    int i;
    freopen("garaj.in","r",stdin);
    freopen("garaj.out","w",stdout);
    scanf("%d%d",&n,&m);
    for (i=1;i<=n;++i)
        scanf("%d%d",&a[i].c,&a[i].t);
    st=1, dr=100000;
    while (st<=dr)
    {
        mij=(st+dr)>>1;
        if (timp(mij)) dr=mij-1;
        else st=mij+1;
    }
    Tmin=st;
    sort(a+1,a+n+1,cmp);
    for (i=1;i<=n && m>=a[i].c*(Tmin/(2*a[i].t));++i)
        m-=a[i].c*(Tmin/(2*a[i].t));
    Nrmin=i;
    printf("%d %d\n",Tmin,Nrmin);
    return 0;
}