#include <iostream>
#include <algorithm>
#define int long long
using namespace std;


struct num{
	int nm[2000];
	num operation * 
};



struct node{
	int left,right;
};


bool cmp(node a,node b){
	return a.left*a.right<b.left*b.right;
}


signed main(){
	int n;
	cin>>n;
	int a,b;
	cin>>a>>b;
	node c[n];
	for(int i=0;i<n;i++)
		cin>>c[i].left>>c[i].right;
	sort(c,c+n,cmp);
	
	int ans=-1,x=a;
	for(int i=0;i<n;i++){
		ans = max(ans,x/c[i].right);
		x *= c[i].left;
	}
	
	cout<<ans;
	return 0;
}