#include <bits/stdc++.h>
using namespace std;
#define MOD 1000000007
typedef long long ll;

int main()
{
    double n, D, H;
    cin >> n >> D >> H;
    double mx = 0.0;
    while (n--)
    {
        int d, h;
        cin >> d >> h;
        double temp = H - ((H - h) / (D - d)) * D;
        mx = max(mx, temp);
    }
    cout << mx << "\n";
}
#define _GIBCXX_DEBUG
#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define all(v) v.begin(), v.end()
using namespace std;
using ll = long long;


int main(void) {
    int N, S, D;
    cin >> N >> S >> D;
    bool ok = false;
    rep(i, N) {
        int x, y;
        cin >> x >> y;
        if (x >= S) continue;
        if (y > D) {
            ok = true;
        }
    }

    if (ok) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }

    return 0;
}