#include <bits/stdc++.h>
using namespace std;
#define ll long long int
#define T     \
    int t;    \
    cin >> t; \
    while (t--)
#define fast                          \
    ios_base::sync_with_stdio(false); \
    cin.tie(NULL)
#define PI 3.141592653589793238462643383
#define pb push_back
#define all(s) s.begin(), s.end()

void print(bool flag) {
    if (flag) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

int main() {
    fast;

    ll n, w;
    cin >> n >> w;
    bool flag = true;
    ll s[n], t[n], p[n];
    ll mx = INT_MIN;
    for (int i = 0; i < n; i++) {
        cin >> s[i] >> t[i] >> p[i];
        mx = max(mx, t[i]);
    }

    vector<ll> ans(mx + 1, 0);
    for (int i = 0; i < n; i++) {
        ans[s[i]] += p[i];
        ans[t[i]] += (-1 * p[i]);
    }
    ll temp = 0;
    for (int i = 0; i <= mx; i++) {
        temp += ans[i];
        //cout << temp << " ";
        if (temp > w) {
            flag = false;
        }
    }
    print(flag);
}
#include<bits/stdc++.h>
using namespace std;
using ll=long long;

int main() {
  int n; int D; int H;
  cin >> n >> D >> H;
  vector<int> d(n), h(n);
  for(int i=0; i<n; ++i) cin >> d[i] >> h[i];

  double ans = 0;
  for(int i=0; i<n; ++i) {
    double b = double(D * h[i] - d[i] * H) / (D - d[i]);
    ans = max(ans, b);
  }
  printf("%.10lf\n", ans);
}
