#include<fstream>
#include<algorithm>
using namespace std;
ifstream f("garaj.in");
ofstream g("garaj.out");
struct camion
{
    int c,t;
} a[100005];
int n,m,s,st,dr,mij,Tmin,Nrmin,w[100005];
inline bool timp(int T)
{
    int i,k=0;
    for (i=1;i<=n;++i)
    {
        k+=a[i].c*(T/a[i].t);
        if (k>=m) return true;
    }
    return false;
}
int main()
{
    int i;
    f>>n>>m;
    for (i=1;i<=n;++i)
        f>>a[i].c>>a[i].t, a[i].t<<=1;
    st=1, dr=2000000000;
    while (st<=dr)
    {
        mij=(st+dr)>>1;
        if (timp(mij)) dr=mij-1;
        else st=mij+1;
    }
    Tmin=st;
    for (i=1;i<=n;++i)
        w[i]=a[i].c*(Tmin/a[i].t);
    sort(w+1,w+n+1);
    for (i=n,s=0;i>0;--i)
    {
        ++Nrmin, s+=w[i];
        if (s>=m) break;
    }
    g<<Tmin<<' '<<Nrmin<<'\n';
    return 0;
}