#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

using isize = size_t;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
using i128 = __int128_t;
using u128 = __uint128_t;
using f64 = long double;
using p2 = pair<i64, i64>;
using el = tuple<i64, i64, i64>;
using mint = atcoder::modint998244353;

void _main();
int main() {
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout << fixed << setprecision(18);
  _main();
}

i64 pow(i64 x, i64 n) {
  i64 res = 1;
  i64 t = x;
  while (n > 0) {
    if (n & 1) res *= t;
    t *= t;
    n >>= 1;
  }
  return res;
}
i64 pow(i64 x, i64 n, i64 m) {
  i64 res = 1;
  i64 t = x % m;
  while (n > 0) {
    if (n & 1) res = res * t % m;
    t = t * t % m;
    n >>= 1;
  }
  return res;
}

void _main() {
  i64 n, p, q;
  cin >> n >> p >> q;
  vector<i64> x(n), a(n), b(n);
  vector<p2> ans(n, {0, 0});
  i64 P = 0, Q = 0;
  for (i64 i = 0; i < n; i++) {
    cin >> x[i] >> a[i] >> b[i];
    if (a[i] + b[i] < x[i]) {
      cout << "No\n";
      return;
    }
    if (x[i] <= a[i]) {
      ans[i] = {x[i], 0};
      P += x[i];
    } else {
      ans[i] = {a[i], x[i] - a[i]};
      P += a[i], Q += x[i] - a[i];
    }
  }
  for (i64 i = 0; i < n; i++) {
    i64 c = max(0ll, min(P - p, min(ans[i].first, b[i] - ans[i].second)));
    ans[i].first -= c, ans[i].second += c;
    P -= c, Q += c;
  }
  if (P > p || Q > q) {
    cout << "No\n";
    return;
  }
  cout << "Yes\n";
  for (auto [a, b] : ans) cout << a << " " << b << "\n";
}