#include <bits/stdc++.h>
using namespace std;
int n;
long long a, b;
long long x1, x2;
pair<long long, long long> v[100005];
int main() {
  scanf("%d", &n);
  scanf("%lld%lld", &x1, &x2);
  for (int i = 0; i < n; i++) {
    scanf("%lld%lld", &a, &b);
    v[i] = {a * x1 + b, a * x2 + b};
  }
  sort(v, v + n);
  int now = 0, pr = 0;
  for (int i = 1; i < n; i++) {
    if (v[i].first != v[i - 1].first) now = pr;
    if (v[now].first != v[i].first && v[now].second > v[i].second) {
      printf("Yes\n");
      return 0;
    }
    if (v[pr].second < v[i].second) pr = i;
  }
  printf("No\n");
}
