#include <fstream>
#include <algorithm>

#define ll long long

using namespace std;

ifstream cin("garaj.in");
ofstream cout("garaj.out");

const int NMAX = 1e5;

struct Camion {
    int c, t;
}a[NMAX + 1];

int n, m;
int contrib[NMAX + 1];

bool check(int x) {
    ll cnt = 0;
    for(int i = 1; i <= n; i++) {
        cnt += x / (a[i].t * 2) * a[i].c;
    }
    return cnt >= m;
}

int main()
{
    cin >> n >> m;
    for(int i = 1; i <= n; i++) {
        cin >> a[i].c >> a[i].t;
    }

    int left = 1, right = 1e9, answer = -1;
    while(left <= right) {
        int mid = (left + right) / 2;
        if(check(mid)) {
            answer = mid;
            right = mid - 1;
        }
        else {
            left = mid + 1;
        }
    }

    cout << answer << ' ';
    for(int i = 1; i <= n; i++) {
        contrib[i] = answer / (a[i].t * 2) * a[i].c;
    }
    sort(contrib + 1, contrib + n + 1);

    ll sum = 0;
    for(int i = n; i >= 1; i--) {
        sum += contrib[i];
        if(sum >= m) {
            cout << n - i + 1 << '\n';
            return 0;
        }
    }
    cout << -1 << '\n';
    return 0;
}