#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> line[100005];
bool cmp(pair<long long, long long> a, pair<long long, long long> b) {
  if (a.first != b.first)
    return a.first > b.first;
  else
    return a.second > b.second;
}
int main() {
  int n;
  cin >> n;
  long long k, b;
  long long x1, x2;
  cin >> x1 >> x2;
  memset(line, 0, sizeof(line));
  for (int i = 0; i < n; ++i) {
    cin >> k >> b;
    line[i].first = k * x1 + b;
    line[i].second = k * x2 + b;
  }
  sort(line, line + n, cmp);
  for (int i = 0, j = 1; i < n && j < n; ++j) {
    if (line[i].first > line[j].first && line[i].second < line[j].second &&
        i != j) {
      printf("YES\n");
      return 0;
    } else {
      i = j;
    }
  }
  printf("NO\n");
}
