#include<fstream>
#include<algorithm>
using namespace std;
struct x2{
    int space;
    int time;
};
x2 x[100003];
int cmp(x2 x, x2 y){
    return  x.time<y.time;
}
long long 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=1000000000000;
    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;
    }
    s=0;
    out<<p<<" ";
    sort(x+1, x+n+1, cmp);
    for(i=1; i<=n; i++){
        s+=(p/x[i].time)*x[i].space;
        if(s>=m)
            break;
    }
    out<<i;
return 0;
}