#include <bits/stdc++.h>
using namespace std;
pair<long long, long long> p[100010];
int main() {
  int n;
  while (scanf("%d", &n) != EOF) {
    long long l, r;
    scanf("%lld %lld", &l, &r);
    for (int i = 0; i < n; i++) {
      long long k, b;
      scanf("%lld%lld", &k, &b);
      p[i].first = l * k + b;
      p[i].second = r * k + b;
    }
    sort(p, p + n);
    bool fg = false;
    for (int i = 1; i < n; i++)
      if (p[i].second < p[i - 1].second) {
        fg = true;
        break;
      }
    if (fg)
      printf("YES\n");
    else
      printf("NO\n");
  }
  return 0;
}
