#include <bits/stdc++.h>
using namespace std;
using ll = long long;

bool comp(tuple<ll,ll,ll,ll> p,tuple<ll,ll,ll,ll> q){
    ll pa,pb,qa,qb;
    tie(pb,pa,ignore,ignore) = p;
    tie(qb,qa,ignore,ignore) = q;
    if(pb != qb)return pb < qb;
    return pa > pb;
}
int main(){
    ll n,p,q; cin >> n >> p >> q;
    vector<tuple<ll,ll,ll,ll>> t;
    for(ll i = 0;i<n;i++){
        ll x,a,b; cin >> x >> a >> b;
        t.emplace_back(b,a,x,i);
    }
    vector<pair<ll,ll>> ans(n);
    sort(t.begin(),t.end(),comp);
    for(auto tup : t){
        auto[b,a,x,i] = tup;
        ll used = min({x,a,p});
        p -= used;
        x -= used;
        ans[i].first = used;
        ll t2;
        if(0<x){
            used = min({x,b,q});
            q -= used;
            x -= used;
            ans[i].second = used;
        }
        if(0<x){
            cout << "No\n";
            return 0;
        }
    }
    cout << "Yes\n";
    for(ll i = 0;i<n;i++)cout << ans[i].first << ' ' << ans[i].second << '\n'; 
}