#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int MAXN = 1e5 + 5;
bool flag = false;
struct Node {
  ll x, y;
} node[MAXN];
bool compare(Node &a, Node &b) {
  if ((a.x - b.x) < 0 && (a.y - b.y) > 0) flag = true;
  if ((a.x - b.x) > 0 && (a.y - b.y) < 0) flag = true;
  if (a.x == b.x) return a.y < b.y;
  return a.x < b.x;
}
int main() {
  ll n, x1, x2, k, b;
  cin >> n >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> k >> b;
    node[i].x = k * x1 + b;
    node[i].y = k * x2 + b;
  }
  sort(node, node + n, compare);
  if (flag)
    cout << "YES" << endl;
  else
    cout << "NO" << endl;
  return 0;
}
