#include <bits/stdc++.h>
using namespace std;
struct line {
  long long k;
  long long b;
  long long val;
  long long pos;
} lines[100001];
line lines2[100001];
int cmp(line a, line b) {
  if (a.val < b.val)
    return 1;
  else if (a.val == b.val)
    return a.k < b.k;
  else
    return 0;
}
int main() {
  int n;
  cin >> n;
  long long x1, x2;
  cin >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> lines[i].k >> lines[i].b;
    lines2[i].k = lines[i].k;
    lines2[i].b = lines[i].b;
    lines[i].pos = i;
    lines[i].val = lines[i].k * x1 + lines[i].b;
  }
  sort(lines, lines + n, cmp);
  long long lastline = lines2[lines[0].pos].k * x2 + lines2[lines[0].pos].b;
  int ok = 0;
  for (int i = 0; i < n; i++) {
    long long fuck = lines2[lines[i].pos].k * x2 + lines2[lines[i].pos].b;
    if (fuck < lastline) {
      ok = 1;
      break;
    }
    lastline = fuck;
  }
  if (ok)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
