#include<bits/stdc++.h>
using namespace std;
#define IOS std::ios::sync_with_stdio(false),cin.tie(0),cout.tie(0);
#define int long long
#define ull unsigned long long
#define fi first
#define se second
#define pi pair<int,int>

const int N=1e6+10;
const int INF=1e18;
int n,m;

struct node{
    char vd;
    int a,b;
}t[20];

int x[N],y[N],id[N];

void init(){
    for(int i=0;i<=19;i++){
        t[i].a=t[i].b=0;
        x[i]=y[i]=id[i]=0;
    }
}

void solve(){
    init();
    int ac,tim;
    cin>>ac>>tim;
    int act,timt;
    act=ac,timt=tim;
    string s;
    int cnt=0;
    for(int i=1;i<=m;i++){
        cin>>s;
        if(s=="+"){
            int a,b;
            cin>>a;
            char cc;
            cin>>cc;
            cin>>b;
            // cerr<<a<<" "<<b<<"\n";
            act--;
            timt-=(a-1)*20+b;
            t[i].vd='+';
            t[i].a=a;
            t[i].b=b;
        }
        else if(s=="-"){
            int a;
            cin>>a;
            t[i].vd='-';
            t[i].a=a;
        }
        else if(s=="."){
            t[i].vd='.';
        }
        else{
            int a,b;
            cin>>a>>b;
            t[i].vd='?';
            t[i].a=a;
            t[i].b=b;
            x[++cnt]=a;
            y[cnt]=b;
            id[cnt]=i;
        }
    }
    if(act<0||timt<0){
        cout<<"No\n";
        return;
    }
    auto check = [&](int t) -> bool {
        int ans=0;
        for(int i=0;i<=30;i++){
            if((1ll<<i)&t){
                ans++;
            }
        }
        // cerr<<ans<<" "<<act<<"\n";
        if(ans==act) return 1;
        return 0;
    };
    for(int i=0;i<=(1ll<<cnt)-1;i++){
        if(!check(i)) continue;
        // cerr<<"!";
        int l=0,r=0;
        for(int j=1;j<=cnt;j++){
            if((1ll<<(j-1))&i){
                l+=(y[j]-x[j])*20+240;
                r+=(y[j]-1)*20+299;
            }
        }
        // cerr<<l<<" "<<r<<" "<<timt<<"\n";
    // cerr<<"!";
        if(timt>=l&&timt<=r){
            cout<<"Yes\n";
            timt-=l;
            for(int j=1;j<=cnt;j++){
                if((1ll<<(j-1))&i){
                    t[id[j]].vd='+';
                    int ttt=min(timt/20,x[j]-1);
                    // cerr<<"ttt= "<<ttt<<"\n";
                    timt-=ttt*20;
                    t[id[j]].a=y[j]-x[j]+ttt+1;
                }
                else{
                    t[id[j]].vd='-';
                    t[id[j]].a=y[j];
                }
            }
            for(int j=1;j<=cnt;j++){
                if((1ll<<(j-1))&i){
                    if(timt>=59){
                        timt-=59;
                        t[id[j]].b=240+59;
                    }
                    else{
                        t[id[j]].b=240+timt;
                        timt=0;
                    }
                }
            }
            for(int i=1;i<=m;i++){
                if(t[i].vd=='+'){
                    cout<<t[i].vd<<" "<<t[i].a<<"/"<<t[i].b;
                }
                else if(t[i].vd=='-'){
                    cout<<t[i].vd<<" "<<t[i].a;
                }
                else if(t[i].vd=='.'){
                    cout<<t[i].vd;
                }
                else{
                    cout<<t[i].vd<<" "<<t[i].a<<"/"<<t[i].b;
                }
                cout<<"\n";
            }
            return;
        }
    }
    cout<<"No\n";
}

signed main(){
    IOS
    int _=1;
    cin>>n>>m;
    while(n--){
        solve();
    }
}