#include <bits/stdc++.h>
using namespace std;
double A2[100001][3], A1[100001][3], B[100001][3];
void merge_sort2(long long int l, long long int r) {
  long long int m = (l + r) >> 1, i, j, k;
  if (l == r) return;
  merge_sort2(l, m);
  merge_sort2(m + 1, r);
  for (i = l, j = m + 1, k = l; i <= m || j <= r;)
    if (j > r || (i <= m && A2[i][0] < A2[j][0])) {
      B[k][0] = A2[i][0];
      B[k][2] = A2[i][2];
      k++;
      i++;
    } else {
      B[k][0] = A2[j][0];
      B[k][2] = A2[j][2];
      k++;
      j++;
    }
  for (k = l; k <= r; k++) {
    A2[k][0] = B[k][0];
    A2[k][2] = B[k][2];
  }
}
void merge_sort1(long long int l, long long int r) {
  long long int m = (l + r) >> 1, i, j, k;
  if (l == r) return;
  merge_sort1(l, m);
  merge_sort1(m + 1, r);
  for (i = l, j = m + 1, k = l; i <= m || j <= r;)
    if (j > r || (i <= m && A1[i][0] < A1[j][0])) {
      B[k][0] = A1[i][0];
      B[k][2] = A1[i][2];
      k++;
      i++;
    } else {
      B[k][0] = A1[j][0];
      B[k][2] = A1[j][2];
      k++;
      j++;
    }
  for (k = l; k <= r; k++) {
    A1[k][0] = B[k][0];
    A1[k][2] = B[k][2];
  }
}
int main() {
  int i, n, k, b;
  double x1, x2;
  cin >> n >> x1 >> x2;
  x1 += 0.0000001;
  x2 -= 0.0000001;
  for (i = 1; i <= n; i++) {
    scanf("%i %i", &k, &b);
    A1[i][0] = k * x1 + b;
    A1[i][2] = i;
    A2[i][0] = k * x2 + b;
    A2[i][2] = i;
  }
  merge_sort1(1, n);
  merge_sort2(1, n);
  for (i = 1; i <= n; i++) {
    if (A1[i][2] != A2[i][2]) {
      printf("YES");
      return 0;
    }
  }
  printf("NO");
}
