#include <bits/stdc++.h>
using namespace std;
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
bool chk(string first, string second) {
  string t1 = first + second;
  string t2 = second + first;
  return t1 < t2;
}
struct sort_pred {
  bool operator()(const pair<int, int> &left, const pair<int, int> &right) {
    return left.second < right.second;
  }
};
long long POW(long long Base, long long Exp) {
  long long y, ret = 1;
  y = Base;
  while (Exp) {
    if (Exp & 1) ret = (ret * y) % 1000000007;
    y = (y * y) % 1000000007;
    Exp /= 2;
  }
  return ret % 1000000007;
}
vector<long long> A, B, C, Res, Mark;
string str, str1, s1, s2;
set<string> st;
vector<string> chlo, final;
vector<pair<long long, long long> > Rec;
int main() {
  long long n, i, j, tmp1, tmp2;
  cin >> n;
  Rec.resize(n);
  long long x1, x2;
  cin >> x1 >> x2;
  for (i = 0; i < n; i++) {
    cin >> tmp1 >> tmp2;
    Rec[i].first = tmp1 * x1 + tmp2;
    Rec[i].second = tmp1 * x2 + tmp2;
  }
  int flag = 0;
  sort(Rec.begin(), Rec.end());
  for (i = 1; i < n; i++) {
    if (Rec[i].second < Rec[i - 1].second) {
      flag = 1;
      break;
    }
  }
  if (!flag)
    printf("NO\n");
  else
    printf("YES\n");
  return 0;
}
