#include <cstdio>
#include <algorithm>
using namespace std;

int n, m;
struct camion{
    int c, t;
}a[100002];
inline bool cmp(camion x, camion y){
    return x.t < y.t;
}
int main()
{
    freopen("garaj.in", "r", stdin);
    freopen("garaj.out", "w", stdout);
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n ; ++i)
        scanf("%d%d", &a[i].c, &a[i].t), a[i].t *= 2;
    int st = 1, dr = 100000;
    while(st <= dr){
        int mij = (st + dr) / 2;
        long long NR = 0;
        for(int i = 1; i <= n ; ++i){
            NR = NR + 1LL * (mij / a[i].t) * a[i].c;
            if(NR >= m) break;

        }
        if(NR >= m)dr = mij - 1;
        else st = mij + 1;
    }
    long long NR = 0;
    for(int i = 1; i <= n ; ++i){
        a[i].t = (st / a[i].t) * a[i].c;
        NR = NR + a[i].t;
    }
    sort(a + 1, a + n + 1, cmp);
    int Min = n, i = 1;
    while(NR >= m){
        NR = NR - a[i].t;
        ++i;
        if(NR < m) break;
        --Min;
    }
    printf("%d %d", st, Min);
    return 0;
}