#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const int MOD=1000000007;
#define INF 1LL<<30
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define all(x) (x).begin(),(x).end()

int main(){   
    int n;
    double D,H;
    cin>>n>>D>>H;
    double ans=0;
    rep(i,n){
        double d,h;
        cin>>d>>h;
        double tmp=(D*h-d*H)/(D-d);
        ans=max(ans,tmp);
    }

    cout<<setprecision(10)<<ans<<endl;
}


#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)

int main(void)
{
  vector<int> A(3);
  rep(i, 3) cin >> A.at(i);
  sort(A.begin(), A.end());
  do {
    if (A.at(0) - A.at(1) == A.at(1) - A.at(2)) {
      cout << "Yes" << endl; return 0;
    }
  } while (next_permutation(A.begin(), A.end()));
  cout << "No" << endl;
}