#include<bits/stdc++.h>

using std::cin;
using std::cout;
using ll = long long;

const int N = 200005;

int n, c;
struct pr { int val, cnt; };
int t[N], d[N];
ll st;
std::vector<pr> v;
int check(int T) {
	v.clear();
	for(int i = 1;i <= n;++i) {
		int turn = t[i] / d[i];
		if(turn >= T) {
			v.push_back({d[i], T - 1});
			v.push_back({d[i] - 1, 1});
		} else {
			v.push_back({d[i], turn});
			if(turn == T - 1) {
				if(t[i] % d[i])
					v.push_back({t[i] % d[i] - 1, 1});
			} else {
				v.push_back({t[i] % d[i], 1});
			}
		}
	}
	sort(v.begin(), v.end(), [](auto x, auto y) {
		return x.val > y.val;
	});
	ll cnt = (ll) T * c;
	ll sum = 0;
	for(auto x : v) {
		ll sub = std::min<ll>(cnt, x.cnt);
		sum += x.val * sub;
		cnt -= sub;
	}
	return st - sum <= c;
}
int main() {
	cin >> n >> c;
	for(int i = 1;i <= n;++i) {
		cin >> t[i] >> d[i];
		st += t[i];
	}
	int l = 0, r = 1e9 + 1;
	for(;l + 1 < r;) {
		int mid = (l + r) >> 1;
		if(check(mid)) {
			r = mid;
		} else {
			l = mid;
		}
	}
	cout << r - 1 << '\n';
}