#include <bits/stdc++.h>
using namespace std;
class InParser {
private:
    FILE *fin;
    char *buff;
    int sp;

    char read_ch() {
        ++sp;
        if (sp == 4096) {
            sp = 0;
            fread(buff, 1, 4096, fin);
        }
        return buff[sp];
    }

public:
    InParser(const char* nume) {
        fin = fopen(nume, "r");
        buff = new char[4096]();
        sp = 4095;
    }

    InParser& operator >> (int &n) {
        char c;
        while (!isdigit(c = read_ch()) && c != '-');
        int sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }

    InParser& operator >> (long long &n) {
        char c;
        n = 0;
        while (!isdigit(c = read_ch()) && c != '-');
        long long sgn = 1;
        if (c == '-') {
            n = 0;
            sgn = -1;
        } else {
            n = c - '0';
        }
        while (isdigit(c = read_ch())) {
            n = 10 * n + c - '0';
        }
        n *= sgn;
        return *this;
    }
};
long long m,n,i,t,mid,in,sf,s,ans,nr;
long long answ[100010];
pair<int,int>v[100010];
int main()
{
    InParser f ("garaj.in");
    ofstream g ("garaj.out");
    f>>n>>m;
    for(i=1; i<=n; ++i)
        f>>v[i].first>>v[i].second;
    in=1;
    sf=2000000000;
    while(in<=sf)
    {
        mid=(in+sf)/2;
        long long s=0;
        for(i=1; i<=n; ++i)
        {
            t=mid/(2*v[i].second);
            s+=t*v[i].first;
        }
        if(s>=m)
        {
            ans=mid;
            sf=mid-1;
        }
        else in=mid+1;
    }
    mid=ans;
    g<<mid<<" ";
    for(i=1; i<=n; ++i)
    {
        t=mid/(2*v[i].second);
        answ[i]=t*v[i].first;
    }
    sort(answ+1,answ+1+n);
    for(i=n; i>=1; --i)
    {
        m-=answ[i];
        if(m<=0)
        {
            g<<n-i+1<<'\n';
            return 0;
        }
    }
    return 0;
}