#include <cstdio>
#include <algorithm>
#define INF 1LL<<38
#define NMax 100000
#define ll long long
using namespace std;

int x[NMax+1];
int y[NMax+1];
int N,M,nr;
ll v[NMax+1];

bool is_good(ll X)
{
    int i;
    ll sum=0;

    for(i = 1; i <= N; ++i)
    {
        v[i] = 1LL * x[i] * ( X / ( 2 * y[i] ) );
        if( v[i] >= M ) { nr = 1; return 1; }
        sum = sum + v[i];
    }

    if( sum < M ) return 0;

    sort(v+1,v+N+1);
    sum = M;
    for(i = N; i >= 1 && sum > 0 ; --i) sum = sum - v[i];
    nr = N-i;

    return 1;
}

int main(){
    freopen("garaj.in","r",stdin);
    freopen("garaj.out","w",stdout);

    int i;
    ll st,dr,mid,T;

    scanf("%d %d",&N,&M);
    for(i = 1; i <= N; ++i) scanf("%d %d", &x[i], &y[i]);

    for(st = 1, dr = INF; st <= dr; )
    {
        mid = (st+dr)>>1;
        if( is_good(mid) ) { T = mid; dr = mid - 1; }
        else st = mid + 1;
    }

    is_good(T);
    printf("%lld %d\n", T, nr);



return 0;
}