#include<cstdio>
using namespace std;
struct camion
{
    int c,t;
} a[100005],b[100005];
int n,m,Tmin,Nrmin;
bool timp(int T)
{
    int i,k=m;
    for (i=1;i<=n && k>0;++i)
        k-=a[i].c*(T/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);
}
void interclasare(int st, int mij, int dr)
{
    int i,j,k=0;
    for (i=st,j=mij+1;i<=mij && j<=dr;)
        if (cmp(a[i],a[j])) b[++k]=a[i++];
        else b[++k]=a[j++];
    for (;i<=mij;++i) b[++k]=a[i];
    for (;j<=dr;++j) b[++k]=a[j];
    for (i=st;i<=dr;++i)
        a[i]=b[i-st+1];
}
void mergesort(int st, int dr)
{
    int mij;
    if (st<dr)
    {
        mij=(st+dr)>>1;
        mergesort(st,mij);
        mergesort(mij+1,dr);
        interclasare(st,mij,dr);
    }
}
int main()
{
    int i,st,dr,mij;
    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), a[i].t<<=1;
    mergesort(1,n);
    st=1, dr=25000;
    while (st<=dr)
    {
        mij=(st+dr)>>1;
        if (timp(mij)) dr=mij-1;
        else st=mij+1;
    }
    Tmin=st;
    for (i=1;i<=n && m>0;++i)
        if (Tmin>=a[i].t)
            ++Nrmin, m-=a[i].c*(Tmin/a[i].t);
    printf("%d %d\n",Tmin,Nrmin);
    return 0;
}