#include <bits/stdc++.h>
const int MOD = int(1e9) + 7;
const int N = 1100;
const int MAXN = int(1e6) + int(1e5);
const int iinf = int(1e9) + int(1e5);
const long long linf = (long long)(1e18) + (long long)(1e17);
const double eps = -1e19;
using namespace std;
long long n, x, y;
pair<long long, long long> p[MAXN];
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);
  cin >> n >> x >> y;
  for (int i = 1; i <= n; ++i) {
    int a, b;
    cin >> a >> b;
    p[i].first = a * x + b;
    p[i].second = a * y + b;
  }
  sort(p + 1, p + n + 1);
  for (int i = 1; i <= n - 1; ++i) {
    if (p[i].second > p[i + 1].second) return cout << "YES", 0;
    ;
  }
  return cout << "NO", 0;
  ;
}
