#include <bits/stdc++.h>
using namespace std;
FILE *fin=fopen("garaj.in", "r");
int n, solt;
long long m;
struct camion{
    int c, t, utilizabil;
}v[100002];
inline bool cmp(const camion a, const camion b)
{
    return a.utilizabil>b.utilizabil;
}
int main()
{
    freopen("garaj.out", "w", stdout);
    int i, st=0, dr=INT_MAX, mijl;
    long long sump;
    fscanf(fin, "%d%lld", &n, &m);
    for(i=1; i<=n; i++)
    {
        fscanf(fin, "%d%d", &v[i].c, &v[i].t);
        v[i].t*=2;
    }
    while(st<=dr)
    {
        sump=0;
        mijl=st+(dr-st)/2;
        for(i=1; i<=n && sump<m; i++)
            sump=sump+(long long)v[i].c*(mijl/v[i].t);
        if(sump>m) solt=mijl, dr=mijl-1;
        else st=mijl+1;
    }
    for(i=1; i<=n; i++) v[i].utilizabil=v[i].c*(solt/v[i].t);
    sort(v+1,v+n+1,cmp);
    sump=0;
    for(i=1; i<=n && sump<m; i++)
        sump+=(long long)v[i].utilizabil;
    printf("%d %d",solt,i-1);
    return 0;
}