#include <iostream>
#include <iomanip>
#include <climits>
#include <stack>
#include <fstream>
#include <algorithm>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <set>
#include <map>
#include <cassert>

#define FOR(i,n) for(int i=0,_n=n;i<_n;i++)
#define FORR(i,s,n) for(int i=s,_n=n;i<_n;i++)
#define mp make_pair
#define pb push_back
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>
#define fs first
#define sec second

#define maxn 100000

using namespace std;
typedef long long ll;

const ll MOD = 1000000007LL;
const double EPS = 1e-12;

vector<pair<ll,ll> > s;
vector<pair<ll,ll> >ovojnica;

template <typename T, typename U>
pair<U,U> operator-(const pair<T,T> &l, const pair<U,U> & r){
    return mp(l.fs-r.fs,l.sec-r.sec);
}

template <typename U>
U v_prod(const pair<U,U> &l, const pair<U,U> &r){
    return l.fs*r.sec-l.sec*r.fs;
}

bool po_kotu(pair<ll,ll>a, pair<ll,ll>b){
    return v_prod(a-s[0],b-s[0])>EPS;
}

bool noter(pair<double,double> p){
    FORR(i,1,ovojnica.size())
        if(v_prod(ovojnica[i-1]-p,ovojnica[i]-p)<EPS)return 0;
    return 1;
}

int main(){
    ll n,x,y;
    scanf("%lld%lld%lld",&n,&x,&y);
    ll maxx=0,maxy=0;
    s.pb(mp(0,0));
    FOR(i,n){
        ll a,b;
        scanf("%lld%lld",&a,&b);
        s.pb(mp(a,b));
        maxx = max(a,maxx);
        maxy = max(b,maxy);
    }
    s.pb(mp(maxx,0));
    s.pb(mp(0,maxy));
    sort(s.begin()+1,s.end(),po_kotu);
    ovojnica.pb(s[0]);
    ovojnica.pb(s[1]);
    FORR(i,2,s.size()){
        pair<ll,ll> r=s[i];
        while(ovojnica.size()>2 && v_prod(r-ovojnica.end()[-2],r-ovojnica.end()[-1])<EPS)ovojnica.pop_back();
        ovojnica.pb(r);
    }
    ovojnica.pb(ovojnica[0]);
    double l=0,d=maxx+maxy;
    FOR(i,100){
        double s=(l+d)/2;
        if(noter(mp(s,(s*y)/x)))l=s;
        else d=s;
    }
    printf("%.15lf\n",x/l);
	return 0;
}