#include <bits/stdc++.h>
using namespace std;
vector<pair<long long, long long> > v;
int main() {
  long long n, m, k, d, t, tem1, tem2, tem3, tem4, y = 1, sum = 0, ans = 0, x1,
                                                   x2;
  string s, c;
  cin >> n;
  cin >> x1 >> x2;
  for (int i = 0; i < n; i++) {
    cin >> tem1 >> tem2;
    tem3 = tem1 * x1 + tem2;
    tem4 = tem1 * x2 + tem2;
    v.push_back({tem3, tem4});
  }
  sort(v.begin(), v.end());
  long long maxi = v[0].second;
  for (int i = 1; i < (int)v.size(); i++) {
    if (v[i].second < maxi) {
      cout << "YES";
      return 0;
    }
    maxi = v[i].second;
  }
  cout << "NO";
  return 0;
}
