#include <bits/stdc++.h>
using namespace std;
ifstream fin("garaj.in");
ofstream fout("garaj.out");
int n, m, solt, solc;
struct jimy
{
    int c, t;
}v[100002];
inline bool cmp(const jimy a, const jimy b)
{
    if(a.t==b.t)
        return a.c>b.c;
    return a.t<b.t;
}
int verif(int val)
{
    int i, sum=0, log, ct=0;
    for(i=1; i<=n; i++)
    {
        log=(val)/(2*v[i].t);
        sum+=log*v[i].c;
        if(log) ct++;
        if(sum>=m) return ct;
    }
    return 0;
}
void bs()
{
    int x, st=0, dr=INT_MAX, mijl;
    while(st<=dr)
    {
        mijl=st+(dr-st)/2;
        x=verif(mijl);
        if(x) solt=mijl, solc=x, dr=mijl-1;
        else st=mijl+1;
    }
}
int main()
{
    int i;
    fin>>n>>m;
    for(i=1; i<=n; i++) fin>>v[i].c>>v[i].t;
    sort(v+1,v+n+1,cmp);
    bs();
    fout<<solt<<' '<<solc<<'\n';
    return 0;
}