#include <bits/stdc++.h>
using namespace std;
const long long mod = 998244353;
struct qujian {
  long long l, r;
  bool operator<(const qujian& A) const {
    if (l != A.l) return l < A.l;
    return r < A.r;
  }
} ans[100005];
int main() {
  int n;
  cin >> n;
  long long L, R;
  cin >> L >> R;
  for (int i = 1; i <= n; i++) {
    long long a, b;
    cin >> a >> b;
    ans[i].l = a * L + b;
    ans[i].r = a * R + b;
  }
  sort(ans + 1, ans + 1 + n);
  bool sign = true;
  for (int i = 2; i <= n; i++) {
    if (ans[i].r < ans[i - 1].r) {
      sign = false;
      break;
    }
  }
  printf("%s\n", !sign ? "YES" : "NO");
}
