#include <bits/stdc++.h>
using namespace std;
long long int lx[100000];
long long int rx[100000];
vector<pair<long long int, long long int>> leftx;
vector<pair<long long int, long long int>> rightx;
bool comp1(pair<long long int, long long int> lhs,
           pair<long long int, long long int> rhs) {
  return (lhs.second < rhs.second) ||
         (lhs.second == rhs.second && rx[lhs.first] < rx[rhs.first]);
}
bool comp2(pair<long long int, long long int> lhs,
           pair<long long int, long long int> rhs) {
  return (lhs.second < rhs.second) ||
         (lhs.second == rhs.second && lx[lhs.first] < lx[rhs.first]);
}
int main() {
  long long int n, xl, xr;
  scanf("%I64d%I64d%I64d", &n, &xl, &xr);
  for (int i = 0; i <= (int)n - 1; ++i) {
    long long int m, c;
    scanf("%I64d%I64d", &m, &c);
    lx[i] = xl * m + c;
    rx[i] = xr * m + c;
    leftx.push_back(make_pair(i, lx[i]));
    rightx.push_back(make_pair(i, rx[i]));
  }
  sort(leftx.begin(), leftx.end(), comp1);
  sort(rightx.begin(), rightx.end(), comp2);
  int f = 0;
  for (int i = 0; i <= (int)n - 1; ++i) {
    if (leftx[i].first != rightx[i].first) {
      f = 1;
      break;
    }
  }
  puts(f ? "Yes" : "No");
  return 0;
}
