#include <fstream>
#include <algorithm>
using namespace std;
ifstream f ("garaj.in");
ofstream g ("garaj.out");
int n,m,s[100003],h[100003],timp=2000000000,nr; //s - capacitatea,  h - timpul de transport
void read()
{
    f>>n>>m;
    for(int i=1;i<=n;++i)
    {
        f>>s[i]>>h[i];
        h[i]*=2; //avem drum dus intors
    }
}
void solve()
{
    int p;
    for(int st=1,dr=2000000000,mij=(st+dr)/2;st<=dr;mij=(st+dr)/2) //cautam binar timpul minim
    {
        p=0;
        for(int i=1;i<=n&&p<m;++i) p+=mij/h[i]*s[i]; //in prima faza luam in considerare ca toate
        //masinile lucreaza
        if(p>=m)
        {
            dr=mij-1;
            timp=min(mij,timp); //avem nevoie de timpul minim
        }
        else st=mij+1;
    }
    for(int i=1;i<=n;++i) h[i]=-(timp/h[i]*s[i]);
    sort(h+1,h+n+1);
    p=0;
    for(nr=0;nr<n&&p<m;++nr) p-=h[nr+1]; //determinam nr minim de masini
}
int main()
{
    read();
    solve();
    g<<timp<<" "<<nr;
    return 0;
}