import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const P = readLong;
      const Q = readLong;
      auto X = new long[N];
      auto A = new long[N];
      auto B = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong;
        A[i] = readLong;
        B[i] = readLong;
      }
      
      long[] ans;
      if (P + Q == X.sum) {
        auto L = new long[N];
        auto R = new long[N];
        bool ok = true;
        foreach (i; 0 .. N) {
          // 0 <= t <= A[i],  0 <= X[i]-t <= B[i]
          L[i] = max(0, X[i] - B[i]);
          R[i] = min(A[i], X[i]);
          ok = ok && (L[i] <= R[i]);
        }
        if (ok && L.sum <= P && P <= R.sum) {
          ans = L.dup;
          long lot = P - L.sum;
          foreach (i; 0 .. N) {
            const t = min(R[i] - L[i], lot);
            ans[i] += t;
            lot -= t;
          }
          assert(lot == 0);
        }
      }
      
      if (ans) {
        writeln("Yes");
        foreach (i; 0 .. N) {
          writeln(ans[i], " ", X[i] - ans[i]);
        }
      } else {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}