#include <bits/stdc++.h>
using namespace std;
const int nm = 100010;
const long long inf = 1000000000000000ll;
int n;
long long a[nm], b[nm];
pair<long long, int> dau[nm], cuoi[nm];
int main() {
  scanf("%d", &n);
  long long x1, x2;
  scanf("%I64d%I64d", &x1, &x2);
  for (int i = 1; i <= n; ++i) {
    scanf("%I64d%I64d", &a[i], &b[i]);
    dau[i] = make_pair(a[i] * x1 + b[i], i);
    cuoi[i] = make_pair(a[i] * x2 + b[i], i);
  }
  sort(dau + 1, dau + n + 1);
  sort(cuoi + 1, cuoi + n + 1);
  int j = 0;
  long long xxx = -inf;
  for (int i = 1; i <= n; ++i) {
    while (j + 1 < i && cuoi[j + 1].first < cuoi[i].first) {
      j++;
      xxx = max(xxx, a[cuoi[j].second] * x1 + b[cuoi[j].second]);
    }
    if (xxx > a[cuoi[i].second] * x1 + b[cuoi[i].second]) {
      printf("YES\n");
      return 0;
    }
  }
  printf("NO\n");
}
