#include <bits/stdc++.h>
using namespace std;
// #include<atcoder/all>
// using mint = atcoder::modint998244353;
using ld = long double;
#define fi first
#define se second
#define all(x) x.begin(),x.end()
#define rep(i,n) for(int i=0;i<(int)(n);++i)
template<typename T>bool chmin(T&a,T b){return b<a?(a=b,1):0;}
template<typename T>bool chmax(T&a,T b){return b>a?(a=b,1):0;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    
    long N,P,Q;
    cin>>N>>P>>Q;
    vector<long> X(N),A(N),B(N);
    rep(i,N)cin>>X[i]>>A[i]>>B[i];
    vector<long> Y(N,0),Z(N,0);

    rep(i,N){
        if(A[i]+B[i]<X[i]){
            cout<<"No\n";
            return 0;
        }
        long z=max(0l,X[i]-A[i]);
        Z[i]+=z;
        Q-=z;
        long y=max(0l, X[i]-B[i]);
        Y[i]+=y;
        P-=y;
    }
    if(P<0||Q<0){
        cout<<"No\n";
        return 0;
    }
    rep(i,N){
        long y=min(P, X[i]-Y[i]-Z[i]);
        Y[i]+=y;
        P-=y;
        long z=min(Q, X[i]-Y[i]-Z[i]);
        Z[i]+=z;
        Q-=z;
        if(Y[i]+Z[i]!=X[i]){
            cout<<"No\n";
            return 0;
        }
    }
    cout<<"Yes\n";
    rep(i,N)cout<<Y[i]<<" "<<Z[i]<<"\n";

}