#include <bits/stdc++.h>
#define int long long

using namespace std;

typedef pair<int, int> PII;
typedef long long LL;

const int base = 1e8;
int ta[1000005], tb[1000005], tc[1000005];
struct BigInt {
	std::vector<int> num;
	int sym;
	BigInt() {
		sym = 0;
	}
	void read() {
		string s;
		cin >> s;
		if (s[0] == '-') sym = 1, s.erase(0, 1);
		reverse(s.begin(), s.end());
		int tmp = 0, has = 0;
		for (auto v : s) {
			tmp = tmp + (v ^ 48) * pow(10, has), has ++;
			if (has == 8) {
				num.emplace_back(tmp);
				tmp = 0, has = 0;
			}
		}
		if (tmp) num.emplace_back(tmp);
		reverse(num.begin(), num.end());
	}
	void print() {
		if (sym == 1) cout << '-';
		for (int i = 0; i < num.size(); i ++)
			if (i != 0)
				printf("%08lld", num[i]);
			else
				printf("%lld", num[i]);
	}
	int operator< (BigInt const &tmp)const {
		if (num.size() < tmp.num.size()) return 1;
		else if (num.size() > tmp.num.size()) return 0;
		else {
			for (int i = 0; i < num.size(); i ++)
				if (tmp.num[i] == num[i]) continue;
				else {
					if (tmp.num[i] > num[i]) return 1;
					else return 0;
				}
			return 2;
		}
	}
	int to_int() {
		int n = num.size(), sum = 0;
		for (int i = 0; i < n; i ++)
			sum = sum * base + num[i];
		return sum;
	}
};

BigInt maxb(BigInt a, BigInt b) {
	if (a < b) return b;
	else return a;
}
BigInt to_big(int x) {
	BigInt res;
	while (x) {
		res.num.emplace_back(x % base);
		x /= base;
	}
	return res;
}
void Fill(vector<int> &ta, int x) {
	vector<int> res;
	int rest = x - (int)ta.size();
	for (int i = 1; i <= rest; i ++)
		res.emplace_back(0);
	for (auto i : ta)
		res.emplace_back(i);
	ta = res;
}
void Del(BigInt &tmp) {
	BigInt res;
	int flg = 0;
	for (int i = 0; i < tmp.num.size(); i ++)
		if (flg || tmp.num[i]) flg = 1, res.num.emplace_back(tmp.num[i]);
	if (!res.num.size()) res.num.emplace_back(0);
	tmp = res;
}
BigInt sum(BigInt tmp1, BigInt tmp2) {
	std::vector<int> ta = tmp1.num, tb = tmp2.num;
	if (ta.size() > tb.size()) swap(ta, tb);
	Fill(ta, (int)tb.size());
	int n = ta.size(), jw = 0;
	BigInt res;
	for (int i = n - 1; i >= 0; i --) {
		int tmp = ta[i] + tb[i] + jw;
		res.num.emplace_back(tmp % base);
		jw = tmp / base;
	}
	if (jw) res.num.emplace_back(jw);
	reverse(res.num.begin(), res.num.end());
	return res;
}
BigInt substract(BigInt tmp1, BigInt tmp2) {
	BigInt res;
	if ((tmp1 < tmp2) == 2 && tmp1.sym == tmp2.sym) {
		res.num.emplace_back(0);
		return res;
	}
	if (tmp1 < tmp2) swap(tmp1, tmp2), res.sym = 1;
	std::vector<int> ta = tmp1.num, tb = tmp2.num;
	Fill(tb, (int)ta.size());
	int n = ta.size(), jw = 0;
	for (int i = n - 1; i >= 0; i --) {
		jw = ta[i] - jw - tb[i];
		res.num.emplace_back((jw + base) % base);
		jw = (jw < 0);
	}

	reverse(res.num.begin(), res.num.end());
	Del(res);
	return res;
}
BigInt operator+ (BigInt tmp1, BigInt tmp2) {
	if (tmp1.sym == 0 && tmp2.sym == 0) return sum(tmp1, tmp2);
	else if (tmp1.sym == 1 && tmp2.sym == 1) {
		BigInt res = sum(tmp1, tmp2);
		res.sym = 1;
		return res;
	} else {
		if (tmp1.sym == 1) swap(tmp1, tmp2);
		BigInt res = substract(tmp1, tmp2);
		return res;
	}
}
BigInt operator- (BigInt tmp1, BigInt tmp2) {
	if (tmp1.sym == 0 && tmp2.sym == 0) {
		return substract(tmp1, tmp2);
	} else if (tmp1.sym == 1 && tmp2.sym == 1) {
		return substract(tmp2, tmp1);
	} else {
		if (tmp1.sym == 1) {
			BigInt res = sum(tmp1, tmp2);
			res.sym = 1;
			return res;
		} else {
			return sum(tmp1, tmp2);
		}
	}
}
void push_zero(BigInt &x, int cnt) {
	int m = x.num.size();
	x.num[m - 1] = x.num[m - 1] * pow(10, cnt % 8);
	for (int i = m - 1; i >= 0; i --)
		if (x.num[i] > base - 1) {
			if (i == 0) x.num.insert(x.num.begin(), x.num[i] / base);
			else x.num[i - 1] += x.num[i] / base;
			x.num[i] %= base;
		}
	for (int i = 1; i <= cnt / 8; i ++)
		x.num.emplace_back(0);
}
BigInt mul(BigInt tmp1, BigInt tmp2) {
	if (tmp1.num.size() > tmp2.num.size()) swap(tmp1, tmp2);
	Fill(tmp1.num, tmp2.num.size());
	reverse(tmp1.num.begin(), tmp1.num.end());
	reverse(tmp2.num.begin(), tmp2.num.end());
	while (tmp1.num.size() > 1 && tmp1.num.back() == 0 && tmp2.num.back() == 0) tmp1.num.pop_back(), tmp2.num.pop_back();
	reverse(tmp1.num.begin(), tmp1.num.end());
	reverse(tmp2.num.begin(), tmp2.num.end());
	if (tmp2.num.size() <= 1025) {
		BigInt res;
		int lena = tmp1.num.size(), lenb = tmp2.num.size(), flg1 = 0, flg2 = 0;
		for (int i = 1; i <= lenb + 1; i ++)
			for (int j = 1; j <= lena + 1; j ++)
				tc[i + j - 1] = 0;
		for (int i = 1; i <= lena; i ++) ta[i] = tmp1.num[lena - i];
		for (int i = 1; i <= lenb; i ++) tb[i] = tmp2.num[lenb - i];
		for (int i = 1; i <= lenb; i ++)
			for (int j = 1; j <= lena; j ++)
				tc[i + j - 1] += ta[j] * tb[i];
		for (int i = 1; i < lena + lenb; i ++)
			if(tc[i] > base - 1) {
				tc[i + 1] += tc[i] / base;
				tc[i] %= base;
			}
		int len = lena + lenb;
		while (tc[len] == 0 && len > 1) len --;
		for (int i = len; i >= 1; i --) res.num.emplace_back(tc[i]);

		return res;
	}

	int n = tmp1.num.size();
	BigInt a1, a2, b1, b2;
	for (int i = 0; i < n / 2; i ++)
		a1.num.emplace_back(tmp1.num[i]), b1.num.emplace_back(tmp2.num[i]);
	for (int i = n / 2; i < n; i ++)
		a2.num.emplace_back(tmp1.num[i]), b2.num.emplace_back(tmp2.num[i]);
	BigInt x = mul(a1, b1), y = mul(a2, b2), z = mul(a1 + a2, b1 + b2) - x - y;
	push_zero(x, (n - n / 2) * 2 * 8);
	push_zero(z, (n - n / 2) * 8);

	Del(x), Del(y), Del(z);
	BigInt tmp = x + y + z;
	return x + y + z;
}
BigInt operator* (BigInt tmp1, BigInt tmp2) {
	int s = tmp1.sym ^ tmp2.sym;
	tmp1.sym = 0, tmp2.sym = 0;
	BigInt res = mul(tmp1, tmp2);
	res.sym = s;
	return res;
}
BigInt operator/ (BigInt tmp, int x) {
	BigInt res;
	int sum = 0;
	for (auto v : tmp.num) {
		sum = sum * base + v;
		res.num.emplace_back(sum / x);
		sum %= x;
	}

	Del(res);
	return res;
}
int operator% (BigInt tmp, int x) {
	BigInt res;
	int sum = 0;
	for (auto v : tmp.num) {
		sum = sum * base + v;
		res.num.emplace_back(sum / x);
		sum %= x;
	}

	return sum;
}

const int N = 1e3 + 10;

int n, ga, gb;
PII a[N];

bool cmp(PII i, PII j) {
	return i.first * i.second < j.first * j.second;
}

signed main() {
	cin.tie(0);
	cout.tie(0);
	ios::sync_with_stdio(0);

	cin >> n >> ga >> gb;
	for (int i = 1; i <= n; i ++)
		cin >> a[i].first >> a[i].second;

	sort(a + 1, a + 1 + n, cmp);

	BigInt res, tmp = to_big(ga);
	for (int i = 1; i <= n; i ++)
		res = maxb(res, tmp / a[i].second), tmp = tmp * to_big(a[i].first);

	res.print();

	return 0;
}