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)); }


int N;
long P, Q;
long[] X, A, B;

long[] solve() {
  auto ans = new long[N];
  long a, b;
  auto needs = new long[N];
  foreach (i; 0 .. N) {
    // 0 <= a <= A[i],  0 <= X[i]-a <= B[i]
    const aL = max(0, X[i] - B[i]);
    const aR = min(A[i], X[i]);
    if (!(aL <= aR)) return null;
    ans[i] = aL;
    a += aL;
    b += (X[i] - aR);
    needs[i] = aR - aL;
  }
  if (!(a <= P && b <= Q)) return null;
  long p = P - a;
  long q = Q - b;
  foreach (i; 0 .. N) {
    {
      const t = min(needs[i], p);
      ans[i] += t;
      needs[i] -= t;
      p -= t;
    }
    {
      const t = min(needs[i], q);
      needs[i] -= t;
      q -= t;
    }
    if (needs[i] > 0) return null;
  }
  return ans;
}

void main() {
  try {
    for (; ; ) {
      N = readInt;
      P = readLong;
      Q = readLong;
      X = new long[N];
      A = new long[N];
      B = new long[N];
      foreach (i; 0 .. N) {
        X[i] = readLong;
        A[i] = readLong;
        B[i] = readLong;
      }
      
      const ans = solve;
      if (ans) {
        writeln("Yes");
        foreach (i; 0 .. N) {
          writeln(ans[i], " ", X[i] - ans[i]);
        }
      } else {
        writeln("No");
      }
    }
  } catch (EOFException e) {
  }
}