#include <bits/stdc++.h>
const int INF = 0x3f3f3f3f;
const int N = 101000;
using namespace std;
int n, x1, x2, r[N];
long long a[N], b[N];
int cmp(int i, int j) {
  if (a[i] != a[j]) return a[i] < a[j];
  return b[i] < b[j];
}
int main() {
  while (scanf("%d", &n) == 1) {
    scanf("%d%d", &x1, &x2);
    int k, t;
    for (int i = 0; i < n; i++) {
      scanf("%d%d", &k, &t);
      a[i] = (long long)k * x1 + t;
      b[i] = (long long)k * x2 + t;
      r[i] = i;
    }
    sort(r, r + n, cmp);
    bool ok = false;
    for (int i = 0; i < n - 1; i++)
      if (a[r[i]] < a[r[i + 1]] && b[r[i]] > b[r[i + 1]]) {
        ok = true;
        break;
      }
    if (ok)
      puts("YES");
    else
      puts("NO");
  }
  return 0;
}
