#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
#define ll long long
const long long mod=998244353;
const long long hmod=46216567629137;
int main(){
    cin.tie(0)->sync_with_stdio(0);
    cout.tie(0);
    int N;
    ll P,Q;
    cin>>N>>P>>Q;
    ll X[N+1],A[N+1],B[N+1];
    for(int i=1;i<=N;i++) cin>>X[i]>>A[i]>>B[i];
    for(int i=1;i<=N;i++){
        if(A[i]+B[i]<X[i]){
            cout<<"No\n";
            return 0;
        }
    }
    ll need=0,min_A=0,max_A=0;
    for(int i=1;i<=N;i++){
        min_A+=X[i]-B[i];
        max_A+=A[i];
        need+=X[i];
    }
    if(P<min_A){
        cout<<"No\n";
        return 0;
    }
    if(Q<(need-max_A)){
        cout<<"No\n";
        return 0;
    }
    ll amari=0;
    for(int i=1;i<=N;i++){
        amari+=B[i];
    }
    amari-=Q;
    cout<<"Yes\n";
    for(int i=1;i<=N;i++){
        ll now_A=X[i]-B[i],now_B=B[i];
        if(now_A+amari<=A[i]){
            now_A+=amari;
            now_B-=amari;
            amari=0;
        }
        else{
            now_A=A[i];
            now_B=X[i]-A[i];
            amari-=B[i]-(X[i]-A[i]);
        }
        cout<<now_A<<" "<<now_B<<"\n";
    }
}