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

#define ull unsigned long long
#define ll long long

void solve() {
    int n, m;
    cin >> n >> m;
    for (int _ = 0; _ < n; _++) {
        int pass, score;
        cin >> pass >> score;
        string op;
        vector<string> inp;
        vector<pair<int,int>> q;
        vector<int>pos;
        for (int j = 0; j < m; j++) {
            cin >> op;
            if (op == "+") {
                int cnt = 0;
                int time = 0;
                string s;
                cin >> s;
                inp.push_back(op + " " + s); // 记录
                bool flag = 0;
                for (auto c : s) {
                    if (c == '/') {
                        flag = 1;
                        continue;
                    }
                    if (flag == 0) {
                        cnt = cnt * 10 + (c - '0');
                    } else {
                        time = time * 10 + (c - '0');
                    }
                }
                score -= (cnt - 1) * 20 + time;
                pass--;
            }

            else if (op == "-") {
                string s;
                cin >> s;
                inp.push_back(op + " " + s); // 记录
            } else if (op == "?") {
                int s1, s2;
                cin >> s1 >> s2;
                s1--,s2--;
                q.push_back({s1,s2});
                pos.push_back(j);
                inp.push_back(op);
            } else if (op == ".") {
                inp.push_back(op);
            }
        }

        score -= pass*240;
        //cout<<"score="<<score<<'\n';
        int N=q.size();
        bool flag=0;
        for(int i=0;i<(1<<N);i++){
            if(__builtin_popcount(i)!=pass)continue;
            int S=score;
            for(int j=0;j<N;j++){
                if(i>>j&1){
                    auto [x,y]=q[j];
                    S-=20*(y-x);
                }
            }
            if(S<0)continue;
            int cnt=S/20;
            for(int j=0;j<N;j++){
                if(i>>j&1){
                    auto [x,y]=q[j];
                    cnt-=x;
                }
            }
            if(cnt>pass*59)continue;
            for(int j=0;j<N;j++){
                auto [x,y]=q[j];
                if(i>>j&1){
                    int tmp=y-x;
                    int tp=min(x,S/20);
                    S-=20*tp;
                    int mm=min(S,59);
                    S-=mm;
                    inp[pos[j]]="+ "+to_string(tmp+tp+1)+'/'+to_string(mm+240);
                }
                else{
                    inp[pos[j]]="- "+to_string(y+1);
                }
            }
            flag=1;
            break;
        }
        if(!flag){
            cout<<"No\n";
            continue;
        }
        cout<<"Yes\n";


        for (int i = 0; i < m; i++) {
            
            cout << inp[i] << endl;
        }
    }
}

signed main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    t = 1;
    for (int i = 0; i < t; i++) {
        solve();
    }
    return 0;
}