#include <bits/stdc++.h>
#define endl '\n'
#define int long long
using namespace std;

void solve() {
    int n, m;
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        int a, b;
        cin >> a >> b;
        int aa = 0, bb = 0;
        vector<string> bd(m);
        vector< tuple<int, int, int> > pd;
        for (int i = 0; i < m; i++) {
            auto &x = bd[i];
            char c;
            cin >> c;
            if ( c == '+' ) {
                int xx, yy;
                cin >> xx;
                cin.get();
                cin >> yy;
                x = "+ " + to_string(xx) + '/' + to_string(yy);
                aa++;
                bb += ( 20 * (xx - 1) + yy );
            } else if ( c == '?' ) {
                int xx, yy;
                cin >> xx >> yy;
                x = "? " + to_string(xx) + ' ' + to_string(yy);
                pd.push_back( { i, xx, yy } );
            } else {
                getline(cin, x);
                x = c + x;
            }
        }
        if ( (int)pd.size() + aa < a || aa > a || bb > b ) {
            cout << "No" << endl;
            continue;
        }
        bool flag = false;
        do {
            int minb = 0, maxb = 0;
            for (int i = 0; i < a - aa; i++) {
                minb += ( 240 + 20 * ( get<2>(pd[i]) - get<1>(pd[i]) ) );
                maxb += ( 299 + 20 * ( get<2>(pd[i]) - 1 ) );
            }
            if ( bb + minb <= b && b <= bb + maxb ) {
                int lv = b - bb - minb;
                for (int i = 0; i < a - aa; i++) {
                    int d = min( ( 59 + 20 * ( get<1>(pd[i]) - 1 ) ), lv );
                    lv -= d;
                    int wa = min( d / 20, get<1>(pd[i]) - 1 );
                    int yy = d - wa * 20 + 240;
                    wa += ( get<2>(pd[i]) - get<1>(pd[i]) );
                    int xx = wa + 1;
                    bd[ get<0>(pd[i]) ] = "+ " + to_string(xx) + '/' + to_string(yy);
                }
                for (int i = a - aa; i < (int)pd.size(); i++) {
                    bd[ get<0>(pd[i]) ] = "- " + to_string( get<2>(pd[i]) );
                }
                flag = true;
                cout << "Yes" << endl;
                for (auto &x : bd) {
                    cout << x << endl;
                }
                break;
            }
        } while ( next_permutation(pd.begin(), pd.end()) );
        if (!flag) {
            cout << "No" << endl;
        }
    }
}

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    int t = 1;
    // cin >> t;
    while (t--) solve();
    return 0;
}