#include <bits/stdc++.h>
using namespace std;
int m,n,i,t,mid,in,sf,s,ans,nr,answ[100010];
pair<int,int>v[100010];
bool ok;
int main()
{
    ifstream f ("garaj.in");
    ofstream g ("garaj.out");
    f>>n>>m;
    for(i=1; i<=n; ++i)
        f>>v[i].first>>v[i].second;
    in=1;
    sf=2000000000;
    while(in<=sf)
    {
        mid=(in+sf)>>1;
        long long s=0;
        for(i=1; i<=n; ++i)
        {
            ok=false;
            t=mid/(2*v[i].second);
            s+=t*v[i].first;
            if(s>=m)
            {
                ans=mid;
                sf=mid-1;
                ok=true;
                break;
            }
        }
        if(!ok) in=mid+1;
    }
    mid=ans;
    g<<mid<<" ";
    for(i=1; i<=n; ++i)
    {
        t=mid/(2*v[i].second);
        answ[i]=t*v[i].first;
    }
    sort(answ+1,answ+1+n);
    for(i=n; i>=1; --i)
    {
        m-=answ[i];
        if(m<=0)
        {
            g<<n-i+1<<'\n';
            return 0;
        }
    }
    return 0;
}