#include <bits/stdc++.h>
using namespace std;
int n, m;
struct camion{
    int c, t, u;
}v[100002];
inline bool cmp(const camion x, const camion y)
{
    return x.u>y.u;
}
int main()
{
    int i, st=2, dr=INT_MAX, mijl, sp;
    freopen("garaj.in", "r", stdin);
    freopen("garaj.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(i=1; i<=n; i++)
    {
        scanf("%d%d", &v[i].c, &v[i].t);
        v[i].t*=2;
    }
    while(st<=dr)
    {
        sp=0;
        mijl=st+(dr-st)/2;
        for(i=1; i<=n && sp<m; i++)
            sp=sp+v[i].c*(mijl/v[i].t);
        if(sp>=m) dr=mijl-1;
        else st=mijl+1;
    }
    for(i=1; i<=n; i++)
        v[i].u=v[i].c*(st/v[i].t);
    sort(v+1,v+n+1,cmp);
    sp=0;
    for(i=1; i<=n && sp<m; i++)
        sp+=v[i].u;
    printf("%d %d",st,i-1);
    return 0;
}