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

struct node {
	int op, x, y;
};

struct node1 {
	int id, x, y;
};

void solve() {
	int n, m;
	cin >> n >> m;
	while (n--) {
		int c1, c2;
		cin >> c1 >> c2;
		vector<node>ans(m + 1);
		vector<node1> ret;
		int sum = 0, cnt = 0;
		for (int i = 1; i <= m; i++) {
			char ch;
			cin >> ch;
			if (ch == '-') {
				int x;
				cin >> x;
				ans[i] = {0, x, -1};
			} else if (ch == '.') {
				ans[i] = {2, 0, 0};
			} else if (ch == '+') {
				string sh;
				cin >> sh;
				ans[i].op = 1;
				int t = 0, j;
				for (j = 0 ; sh[j] != '/' ; j++) {
					//cout << j << '\n';
					t = t * 10 + (sh[j] - '0');
				}
				sum += (t - 1) * 20;
				ans[i].x = t;
				t = 0;
				for (j = j + 1 ; j < sh.size() ; j++)
					t = t * 10 + (sh[j] - '0');
				sum += t;
				ans[i].y = t;
				cnt++;
			} else {
				int x, y;
				cin >> x >> y;
				ret.push_back({i, x, y});
			}
		}
		if (sum > c2 || cnt > c1) {
			cout << "No\n";
			return;
		}
		//cout << sum << '\n';
		int nn = ret.size(), ok = 0;
		//cout << nn << ' ';
		for (int i = 0 ; i < (1 << nn) ; i++) {
			int cn = 0, su = 0, chac1 = 0;
			for (int j = 0 ; j < nn ; j++) {
				if ((i >> j) & 1) {
					cn++;
					su += 240 + (ret[j].y - ret[j].x) * 20;
					chac1 += (ret[j].x - 1);
				}
			}
			if (cn + cnt != c1 || su + sum > c2)
				continue;

			int cha = c2 - su - sum, chac = min(chac1, cha / 20);
			//cout << cha << '\n';
			cha -= chac * 20;
			for (int j = 0 ; j < nn ; j++) {
				if ((i >> j) & 1) {
					int t1 = min(59, cha);
					ans[ret[j].id].y = t1 + 240;
					ans[ret[j].id].op = 1;
					cha -= t1;
					t1 = min(chac, ret[j].x - 1);
					ans[ret[j].id].x = t1 + 1 + ret[j].y - ret[j].x;
					chac -= t1;
				} else {
					ans[ret[j].id].op = 0;
					ans[ret[j].id].x = ret[j].y;
				}
			}
			if (cha == 0) {
				ok = 1;
				break;
			}
		}
		if (ok) {
			cout << "Yes\n";
			for (int i = 1; i <= m; i++) {
				if (ans[i].op == 0)
					cout << "- " << ans[i].x << '\n';
				else if (ans[i].op == 2)
					cout << ".\n";
				else
					cout << "+ " << ans[i].x << "/" << ans[i].y << '\n';
			}
		} else
			cout << "No\n";
	}
}

int main() {
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin >> t;
	while (t--) {
		solve();
	}


	return 0;
}