#include <bits/stdc++.h>
using namespace std;
const int INF = (int)1e9 + 7;
const long long LINF = (long long)1e18 + 9;
const int MXN = (int)1e6 + 10;
const double EPS = (double)1e-9;
int x1, x2;
int n;
vector<pair<long long, long long> > tt;
bool exist;
int main() {
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; ++i) {
    int a, b;
    cin >> a >> b;
    long long tmp1 = a * 1LL * x1 + 1LL * b;
    long long tmp2 = a * 1LL * x2 + 1LL * b;
    tt.push_back(make_pair(tmp1, tmp2));
  }
  sort(tt.begin(), tt.end());
  long long tmp = tt[0].second;
  for (int i = 1; i < n; ++i) {
    if (tt[i].second < tmp) {
      exist = true;
      break;
    }
    tmp = max(tt[i].second, tmp);
  }
  cout << (exist ? "Yes" : "No");
  return 0;
}
