#include <bits/stdc++.h>
using namespace std;
struct nod {
  long long a, b;
} num[110000];
long long l, x11, x22, k11, b11, i, n, mi[110000];
bool cmp(nod a, nod b) { return (a.a < b.a); }
int main() {
  scanf("%lld", &n);
  scanf("%lld%lld", &x11, &x22);
  for (i = 1; i <= n; i++) {
    scanf("%lld%lld", &k11, &b11);
    num[i].a = k11 * x11 + b11;
    num[i].b = k11 * x22 + b11;
  }
  sort(num + 1, num + 1 + n, cmp);
  mi[n + 1] = 10000000000000000;
  for (i = n; i >= 1; i--) mi[i] = min(mi[i + 1], num[i].b);
  l = 1;
  for (i = 1; i <= n; i++) {
    while (num[l].a == num[i].a && l <= n) l++;
    if (l > n) break;
    if (mi[l] < num[i].b) {
      printf("YES\n");
      return (0);
    }
  }
  printf("NO\n");
}
