#include <cstdio>
#include <algorithm>
using namespace std;
long long v[100002],w[100002];
long long verifincad (long long v[],long long w[],long long timp,long long m,long long n){
    long long sticle,i;
    sticle=0;
    for (i=1;i<=n && sticle<m;i++)
        sticle+=(timp/w[i])*v[i];

    if (sticle>=m)
        // ma incadrez
        return 1;
    else
        return 0;
    // nu ma incadrez
}
int main()
{
    FILE *fin=fopen ("garaj.in","r");
    FILE *fout=fopen ("garaj.out","w");
    long long n,m,mini,i,st,ok,dr,drm,mid,timp,cam,sticle;
    fscanf (fin,"%lld%lld",&n,&m);
    mini=2000000000;
    for (i=1;i<=n;i++){
        fscanf (fin,"%lld%lld",&v[i],&w[i]);
        w[i]*=2;
        st=0;
        if (m%v[i]==0)
            st=1;
        drm=(m/v[i])*w[i];
        if (st==0)
            drm+=w[i];
        if (mini>drm)
            mini=drm;
    }
    // este clar ca putem sa ne incadram cel mult in timpul mini
    st=1;
    //prlong longf ("%d",mini);
    dr=mini/2;
    ok=0;
    while (st<=dr){
        mid=(st+dr)/2;
        timp=mid*2;
        // trebuie acum sa vedem daca ne putem incadra in timpul timp
        ok=verifincad (v,w,timp,m,n);
        if (ok==0)
            st=mid+1;
        else
            dr=mid-1;
    }
    timp=st*2;
    fprintf (fout,"%lld",timp);
    // am gasit timpul necesar
    for (i=1;i<=n;i++)
        v[i]=(timp/w[i])*v[i];
    sort (v+1,v+n+1);
    sticle=0;
    i=n;
    cam=0;
    while (i>0 && sticle<m){
        sticle+=v[i];
        cam++;
        i--;
    }
    fprintf (fout," %lld",cam);
    return 0;
}