#include<fstream>
#include<algorithm>
using namespace std;
struct x2{
    int space;
    int time;
};
x2 x[100003];
int xx[100003], n, m, i, p, u, mij, s;
ifstream in("garaj.in");
ofstream out("garaj.out");
int main(){
    in>>n>>m;
    for(i=1; i<=n; i++){
        in>>x[i].space>>x[i].time;
        x[i].time*=2;
    }
    p=1; u=100000000;
    while(p<=u){
        mij=p+(u-p)/2;
        s=0;
        for(i=1; i<=n; i++){
            s+=(mij/x[i].time)*x[i].space;
            if(s>=m)
                break;
        }
        if(s>=m)
            u=mij-1;
        else
            p=mij+1;
    }
    for(i=1; i<=n; i++)
        xx[i]=(p/x[i].time)*x[i].space;
    s=0;
    out<<p<<" ";
    sort(xx+1, xx+n+1);
    for(i=n; i>=1; i--){
        s+=xx[i];
        if(s>=m)
            break;
    }
    out<<(n-i+1);
return 0;
}