#include<iostream>
using namespace std;
#include<algorithm>
int N;
int G_l;
int G_r;
typedef struct Node
{
	int l;
	int r;
};
bool cmp(Node a,Node b)
{
	if(a.l!=b.r)return a.l<b.l;
	return a.r < b.r;
}
int main()
{
	cin >> N;
	cin >> G_l >> G_r;
	Node* arr = new Node[N];
	for (int i = 0; i < N; i++)
	{
		cin >> arr[i].l >> arr[i].r;
		
	}
	sort(arr, arr + N, cmp);
	long long ans = 0;
	long long sum = G_l;
	for (int i = 0; i < N; i++)
	{
		if (sum / arr[i].r > ans)ans = sum / arr[i].r;
		sum *= arr[i].l;
	}
	cout << ans << endl;
	return 0;
}