#include<bits/stdc++.h>
using namespace std;
#define ll long long
struct dcm{
	ll index;
	ll lefth;
	ll righth;
};
bool compare(dcm a,dcm b){
	return a.index<b.index;
}
int main(){
register ll n,a,b,permax,temp;
register vector<ll>v1,v2;
cin>>n;
register dcm dc[n];
cin>>a>>b;
for(register ll i=0;i<n;i++){//读取 
	dc[i].index=i;
	cin>>dc[i].lefth>>dc[i].righth;
}
if(n==1){
		a/=dc[0].righth;
		cout<<a;
		return 0;
}
//cout<<a<<" "<<b<<endl;
//for(dcm x:dc)cout<<x.lefth<<" "<<x.righth<<endl;
sort(dc,dc+n,compare);


while(next_permutation(dc,dc+n,compare)){
//	for(dcm x:dc)cout<<x.index;
//	cout<<endl;
	for(ll i=n-2;i>-1;--i){
		temp=1;
		for(ll j=i;j>-1;--j)temp*=dc[j].lefth;
		permax=a*temp/dc[i+1].righth;
		v1.push_back(permax);
	}
	ll a=*(max_element(v1.begin(), v1.end()));
	v1.clear();
	v2.push_back(a);
//	for(ll x:v1)cout<<x<<" ";cout<<endl; 	
};
ll ans =*(min_element(v2.begin(), v2.end()));
cout<<ans;
return 0;
}