#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 need=0;
    ll min_A=0,max_A=0;
    ll X[N+1],A[N+1],B[N+1];
    for(int i=1;i<=N;i++){
        cin>>X[i]>>A[i]>>B[i];
        if(A[i]+B[i]<X[i]){
            cout<<"No"<<endl;
            return 0;
        }
        min_A+=X[i]-B[i];
        max_A+=A[i];
        need+=X[i];
    }
    if(P<min_A){
        cout<<"No"<<endl;
        return 0;
    }
    if((need-max_A)>Q){
        cout<<"No"<<endl;
        return 0;
    }
    cout<<"Yes\n";
    ll amari=0;
    for(int i=1;i<=N;i++){
        amari+=max(0LL,(X[i]-B[i])-A[i]);
    }
    for(int i=1;i<=N;i++){
        int ansA=X[i]-B[i],ansB=B[i];
        if(ansA+amari<=A[i]){
            ansA+=amari;
            ansB-=amari;
            amari=0;
        }
        else{
            ansA=A[i];
            ansB=X[i]-B[i];
            amari-=2*B[i]-X[i];
        }
        cout<<ansA<<" "<<ansB<<"\n";
    }
}