#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N = 20;
int t, n;
char a[N];
int x[N], y[N];
pii s[1 << N];
//基础罚时以及剩下多少次可以罚时
int lowbit(int x) {
    int s = 0;
    while (x) {
        s++;
        x -= (x & -x);
    }
    return s;
}
int sss = 0;
void solve()
{
    sss++;
    int s1, s2;
    cin >> s1 >> s2;
    int sumf = 0;
    int sumd = 0;
    priority_queue<int> mx;
    priority_queue<int, vector<int>, greater<int>> mi;
    for (int i = 0; i < n; i++) {
		cin>>a[i];
		if (a[i]=='+') {
			int cs=0,sj=0,dd=0;
			string s;
			cin>>s;
			for (int j=0; j<s.size(); j++) {
				if (s[j]=='/') {
					dd=j;
					break;
				}
				cs=cs*10+s[j]-'0';
			}
			for (int j=dd+1; j<s.size(); j++) {
				sj=sj*10+s[j]-'0';
			}
			x[i]=cs;
			y[i]=sj;
            sumd ++;
            sumf += x[i] * 20 - 20 + y[i];
		} else if (a[i]=='-') {
			cin>>x[i];
		} else if (a[i]=='.') {
			continue;
		} else {
			cin>>x[i]>>y[i];
		}
    }
    int need = s1 - sumd;
    for (int i = 0; i < (1 << n); i++) {
        s[i] = {0, 0};
        if (lowbit(i) != need) {
            continue ;
        }
        bool use = 1;
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1) {
                if (a[j] != '?') {
                    use = 0;
                    break;
                }
            }
        }
        if (!use) {
            continue ;
        }
        for (int j = 0; j < n; j++) {
            if ((i >> j) & 1) {
                s[i].first += (y[j] - x[j]) * 20 + 240;
                s[i].second += y[j] * 20 + 299;
            }
        }
        if (sumf + s[i].first <= s2 && sumf + s[i].second >= s2) {
            cout << "Yes\n";
            //减去基础罚时
            ll d = s2 - sumf;
            d -= s[i].first;
            for (int j = 0; j < n; j++) {
                if ((i >> j) & 1) {
                    a[j] = '+';
                } else {
                    if (a[j] == '?') {
                        a[j] = '-';
                        x[j] = y[j];
                    }
                }
            }
            //现在x[i]存的是之前提交过几次，y[i]存的是总共提交
            for (int j = 0; j < n; j++) {
                if ((i >> j) & 1) {
                    x[j] = y[j] - x[j] + 1;
                    while (d >= 20 && x[j] < y[j]) {
                        d -= 20;
                        x[j]++;
                    }
                    int mx = min(d, 1ll * 59);
                    y[j] = 240 + mx;
                    d -= mx;
                }
            }
            int f = 0;
            sumf = 0;
            for (int j = 0; j < n; j++) {
                if (a[j] == '?') 
                a[j] = '-';
                cout << a[j] << ' ';
                if (a[j] == '+') {
                    cout << x[j] << '/' << y[j] << '\n';
                    sumf += x[j] * 20 - 20 + y[j];
                } else if (a[j] == '-') {
                    cout << x[j] << '\n';
                } else {
                    cout << '\n';
                }
            }
            while (sumf != s2) {
                
            }
            return ;
        }
    }
    cout << "No\n";
}
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
    cin >> t >> n;
    while(t--)
    solve();
    return 0;
}
/*
6700
*/