#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll long long
#define maxN 100002
using namespace std;
int n, i, j, nrc, sol, x;
ll m;
struct elem
{
    ll c;
    ll t;
}v[maxN];
int cmp(const elem a, const elem b)
{
    return a.c * ((x * 1LL) / a.t) > b.c * ((x * 1LL) / b.t);
}
void read()
{
    freopen("garaj.in", "r", stdin);
    scanf("%d %lld", &n, &m);
    for (i = 1; i <= n; ++ i)
        scanf("%lld %lld", &v[i].c, &v[i].t),
             v[i].t *= 2;
    sort(v + 1, v + n + 1, cmp);
}
int ok(int x)
{
    int i;
    ll sum = 0LL;
    nrc = 0;
    for (i = 1; i <= n; ++ i)
    {
        sum += v[i].c * ((x * 1LL) / v[i].t);
        if (sum >= m)
            break;
    }
    return sum >= m;
}
int bs()
{
    int p = 1 << 30, i = p;
    while (p)
    {
        if (i - p >= 0 && ok(i - p))
            i -= p,
                sol = nrc;
        p /= 2;
    }
    return i;
}
void write()
{
    int sum = 0;
    freopen("garaj.out", "w", stdout);
    printf("%d", x = bs());
    sort(v + 1, v + n + 1, cmp);
    for (i = 1; i <= n; ++ i)
    {
        sum += v[i].c * ((x * 1LL) / v[i].t);
        ++ sol;
        if (sum >= m)
            break;
    }
    printf(" %d", sol);
}
int main()
{
    read();
    write();
    return 0;
}