#include <bits/stdc++.h>
using namespace std;
long long pwr(long long a, long long b, long long mod) {
  a %= mod;
  if (a < 0) a += mod;
  long long ans = 1;
  while (b) {
    if (b & 1) ans = (ans * a) % mod;
    a = (a * a) % mod;
    b /= 2;
  }
  return ans;
}
long long pwr(long long a, long long b) {
  long long ans = 1;
  while (b) {
    if (b & 1) ans *= a;
    a *= a;
    b /= 2;
  }
  return ans;
}
long long gcd(long long a, long long b) {
  while (b) {
    long long temp = a;
    a = b;
    b = temp % b;
  }
  return a;
}
long long lcm(long long a, long long b) { return (a / gcd(a, b)) * b; }
string toString(int j) {
  string s = "";
  while (j) {
    int temp = j % 10;
    s += temp + '0';
    j = j / 10;
  }
  reverse(s.begin(), s.end());
  return s;
}
long long modularInverse(long long a, long long m) {
  assert(false);
  return pwr(a, m - 2, m);
}
const int mod = 1000000007;
const int N = 1e5 + 5;
pair<long long, long long> arr[N];
int main() {
  int n;
  cin >> n;
  int x1, x2;
  cin >> x1 >> x2;
  for (int i = 0; i < n; ++i) {
    long long k, b;
    cin >> k >> b;
    arr[i] = make_pair(k * x1 + b, k * x2 + b);
  }
  sort(arr, arr + n);
  long long my2 = -1e15;
  for (int i = 0; i < n; ++i) {
    if (arr[i].second < my2) {
      cout << "YES\n";
      return 0;
    }
    my2 = max(my2, arr[i].second);
  }
  cout << "NO\n";
  return 0;
}
