#include <bits/stdc++.h>
#define inf 0x3f3f3f3f
#define infi 0x3f3f3f3f3f3f3f3f
using namespace std;

typedef long long ll;

const int N = 1020;
const int M = 20;

int n, m;

struct node {
    int sor, plt;  // socre penalty
    int nsor, nplt;
    char c[M];
    int tries[M], time[M], extr[M];
    int check;
} team[N];

void solve(int p) {
    for (int i = 0; i < (1 << m); i++) {
        int splt = team[p].nplt, mplt = team[p].nplt;
        int cot = 0;
        for (int j = 0; j < m; j++) {
            if (((i >> j) & 1) && team[p].c[j + 1] == '?') {
                cot++;
                splt += (team[p].tries[j + 1] - team[p].extr[j + 1]) * 20;
                splt += 240;
                // if(team[p].tries[j + 1] == team[p].extr[j + 1]) cnt++;
                mplt += (team[p].tries[j + 1] - 1) * 20;
                mplt += 299;
            }
        }
        if (cot + team[p].nsor != team[p].sor)
            continue;
        int dis = team[p].plt - splt;
        if (dis >= 0 && mplt >= team[p].plt) {
            team[p].check = 1;
            for (int j = 0; j < m; j++) {
                if (((i >> j) & 1) && team[p].c[j + 1] == '?') {
                    // cout << dis << "\n";
                    team[p].c[j + 1] = '+';
                    int add = dis / 20;
                    if (add > team[p].extr[j + 1] - 1) {
                        dis -= (team[p].extr[j + 1] - 1) * 20;
                    } else {
                        dis -= add * 20;
                        team[p].tries[j + 1] -= (team[p].extr[j + 1] - add - 1);
                    }
                    if (dis > 59) {
                        dis -= 59;
                        team[p].time[j + 1] = 299;
                    } else {
                        team[p].time[j + 1] = 240 + dis;
                        dis = 0;
                    }
                }
            }
            return;
        }
    }
}

void init() {
    cin >> n >> m;
    for (int i = 1; i <= n; i++) {
        cin >> team[i].sor >> team[i].plt;
        for (int j = 1; j <= m; j++) {
            cin >> team[i].c[j];
            if (team[i].c[j] == '.') {
                continue;
            } else if (team[i].c[j] == '+') {
                team[i].nsor++;
                string s, t = "", m = "";  // tries time
                cin >> s;
                bool pd = true;
                for (int k = 0; k < (int)s.size(); k++) {
                    if (s[k] != '/' && pd) {
                        t += s[k];
                    } else if (s[k] != '/' && !pd) {
                        m += s[k];
                    } else {
                        pd = false;
                    }
                }
                team[i].tries[j] = stoi(t);
                team[i].time[j] = stoi(m);
                team[i].nplt += (team[i].tries[j] - 1) * 20 + team[i].time[j];
            } else if (team[i].c[j] == '-') {
                cin >> team[i].tries[j];
            } else if (team[i].c[j] == '?') {
                cin >> team[i].extr[j] >> team[i].tries[j];
            }
        }
        // cout << team[i].nplt << "\n";
        if (team[i].nsor > team[i].sor || team[i].nplt > team[i].plt) {
            continue;
        }
        if (team[i].nplt < team[i].plt) {
            solve(i);
        } else if (team[i].nplt == team[i].plt) {
            team[i].check = 1;
        }
    }
}

void output() {
    for (int i = 1; i <= n; i++) {
        if (team[i].check == 0) {
            cout << "No\n";
            continue;
        }
        cout << "Yes\n";
        for (int j = 1; j <= m; j++) {
            if (team[i].c[j] == '+') {
                cout << team[i].c[j] << " ";
                cout << team[i].tries[j] << "/" << team[i].time[j];
            } else if (team[i].c[j] == '-' || team[i].c[j] == '?') {
                cout << '-' << " ";
                cout << team[i].tries[j];
            } else if (team[i].c[j] == '.') {
                cout << ".";
            }
            cout << "\n";
        }
    }
}

int main() {
    ios::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
    init();
    output();
    return 0;
}