#include <bits/stdc++.h>
using namespace std;
const int mod = int(1e9) + 7, INF = 0x3fffffff, maxn = 1e5 + 40;
int n, k[maxn], b[maxn];
long long x1, x2;
struct place {
  long long xx, yy;
  int num;
} a[maxn];
bool cmp1(const place& a, const place& b) {
  if (a.xx == b.xx) return a.yy < b.yy;
  return a.xx < b.xx;
}
bool cmp2(const place& a, const place& b) {
  if (b.yy == a.yy) return a.xx < b.xx;
  return a.yy < b.yy;
}
int main(void) {
  cin >> n;
  cin >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    scanf("%d%d", &k[i], &b[i]);
    a[i].xx = k[i] * x1 + b[i];
    a[i].yy = k[i] * x2 + b[i];
  }
  sort(a, a + n, cmp1);
  int m = n;
  bool ok = false;
  for (int i = 0; i < m; i++) {
    a[i].num = i;
  }
  sort(a, a + m, cmp2);
  for (int i = 0; i < m; i++) {
    if (a[i].num != i) {
      ok = true;
      break;
    }
  }
  if (ok)
    cout << "Yes" << endl;
  else
    cout << "No" << endl;
  return 0;
}
