#include <bits/stdc++.h>

using namespace std;

#define int long long

int n, m;

using vi = vector<int>;
using vs = vector<string>;


vector<string> state;
vector<int> x, y;
vi unKnow;

int finalSolved, finalPenalty, frozenSolved;
int solved = 0, penalty = 0;
bool flag;

void check(vi v) {
    int pPenalty = penalty;
    auto sState = state;
    auto xX = x, yY = y;
    for (int i = 0, j; i < unKnow.size(); i++) {
        j = unKnow[i];
        if (v[i] == 1) {
            sState[j] = "+";
            xX[j] = y[j] - x[j] + 1;
            yY[j] = 240;
            pPenalty += (xX[j] - 1) * 20 + yY[j];
        } else {
            sState[j] = "-";
            xX[j] = y[j];
            yY[j] = 0;
        }
    }
    if (pPenalty > finalPenalty)
        return;
    for (int i = 0, j; i < unKnow.size(); i++) {
        if (v[i] == 0) continue;
        j = unKnow[i];
        while (xX[j] < y[j] and pPenalty + 20 <= finalPenalty) {
            pPenalty += 20, xX[j]++;
        }
    }
    for (int i = 0, j, t; i < unKnow.size(); i++) {
        if (v[i] == 0) continue;
        j = unKnow[i];
        t = min(59ll, finalPenalty - pPenalty);
        pPenalty += t, yY[j] += t;
    }
    if (pPenalty != finalPenalty) return;
    flag = true;
    state = sState, x = xX, y = yY;
    return;
}

void dfs(int i, vi v, int cnt) {
    if (flag == true) return;
    if (cnt == frozenSolved) {
        check(v);
        return;
    }
    if (i >= unKnow.size()) return;
    dfs(i + 1, v, cnt);
    v[i] = 1;
    dfs(i + 1, v, cnt + 1);
    v[i] = 0;
    return;
}

void solve() {
    cin >> finalSolved >> finalPenalty;
    solved = 0, penalty = 0;
    state = vs(m), x = vi(m), y = vi(m);
    unKnow = vi();

    for (int i = 0; i < m; i++) {
        cin >> state[i];
        if (state[i] == "+") {
            char s;
            cin >> x[i] >> s >> y[i];
            solved++, penalty += (x[i] - 1) * 20 + y[i];
        } else if (state[i] == "?") {
            cin >> x[i] >> y[i];
            unKnow.push_back(i);
        } else if (state[i] == "-") {
            cin >> x[i];
        }
    }
//    for( auto  i = 0 ; i < m ; i ++ ){
//        cerr << state[i] << " " << x[i] << " " << y[i] << "\n";
//    }


    if (solved > finalSolved or penalty > finalPenalty) {
        cout << "No\n";
        return;
    }
//    for( auto i : unKnow )
//        cout << i << " ";
//    cout << "\n";
    if (solved + unKnow.size() < finalSolved) {
        cout << "No\n";
        return;
    }

    frozenSolved = finalSolved - solved;

    flag = false;

    dfs(0, vi(unKnow.size()), 0);

    if (flag == false) {
        cout << "No\n";
        return;
    }
    cout << "Yes\n";
    for (int i = 0; i < m; i++) {
        cout << state[i];
        if (state[i] == "+") {
            cout << " " << x[i] << "/" << y[i];
        } else if (state[i] == "-") {
            cout << " " << x[i];
        }
        cout << "\n";
    }
    return;
}

int32_t main() {
    cin >> n >> m;
    for (; n; n--)
        solve();
    return 0;
}