#include <fstream>
#include <vector>
#include <algorithm>

using namespace std;

ifstream fin("garaj.in");
ofstream fout("garaj.out");

struct Camion {
    long long c, t;
};

int n;
long long m;
vector<Camion> v;

bool ok(long long timp) {
    long long total = 0;
    for(int i = 0; i < n; ++i) {
        long long drumuri = timp / (2 * v[i].t);
        long long ramane = timp % (2 * v[i].t);
        long long extra = (ramane >= v[i].t ? v[i].c : 0);
        total += drumuri * v[i].c + extra;
        if(total >= m) {
            return true;
        }
    }
    return false;
}

int main() {
    fin >> n >> m;
    v.resize(n);
    for(int i = 0; i < n; ++i) {
        fin >> v[i].c >> v[i].t;
    }
    fin.close();
    
    long long st = 0, dr = 1;
    while(!ok(dr)) {
        dr *= 2;
    }
    
    while(st < dr) {
        long long mid = (st + dr) / 2;
        if(ok(mid)) {
            dr = mid;
        } else {
            st = mid + 1;
        }
    }
    
    long long Tmin = st;
    vector<long long> poate;
    for(int i = 0; i < n; ++i) {
        long long drumuri = Tmin / (2 * v[i].t);
        long long ramane = Tmin % (2 * v[i].t);
        long long extra = (ramane >= v[i].t ? v[i].c : 0);
        poate.push_back(drumuri * v[i].c + extra);
    }
    
    sort(poate.begin(), poate.end(), greater<long long>());
    long long suma = 0;
    int cnt = 0;
    for(long long x : poate) {
        if(suma >= m) {
            break;
        }
        suma += x;
        ++cnt;
    }
    
    fout << Tmin << " " << cnt << "\n";
    fout.close();
    return 0;
}