#define _CRT_SECURE_NO_WARNINGS
#include <algorithm>
#include <cmath>
#include <cstring>
#include <iostream>
#include <queue>
#include <string>
using namespace std;
#define debug(x) cerr << #x << " == " << x << endl
#define el '\n'
#define fir first
#define sec second
typedef long long ll;
typedef pair<int, int> PII;
const int mod = 1000000007;
const int inf = 0x3f3f3f3f;
const int N = 200020;
struct problem {
	char typ;
	bool ac;
	int sub, tim;
	int mn, mx;
};
void solve()
{
	int n, m;
	cin >> n >> m;
	while (n--) {
		int totp, tott;
		cin >> totp >> tott;
		char ch;
		vector<problem> t(15), a(15);
		vector<int> f(15);
		int nowtim = 0, nowp = 0;
		for (int i = 1; i <= m; i++) {
			cin >> t[i].typ;
			if (t[i].typ == '.')
				continue;
			if (t[i].typ == '?') {
				cin >> t[i].mn >> t[i].mx;
				t[i].mn = t[i].mx - t[i].mn;
			}
			if (t[i].typ == '-') {
				cin >> t[i].sub;
			}
			if (t[i].typ == '+') {
				cin >> t[i].sub >> ch >> t[i].tim;
				nowtim += (t[i].sub - 1) * 20 + t[i].tim;
				nowp++;
				f[i] = 1;
			}
		}
		// cout << nowtim << endl;
		int resp = totp - nowp, rest = tott - nowtim, fff = 0;
		for (int now = 0; now < (1 << (m + 1)); now++) {
			vector<int> res(15, 0);
			int flag = 0, tt = 0;
			for (int i = 1; i <= m; i++) {
				if (now >> i & 1) {
					res[i] = 1;
					tt++;
				}
			}
			if (tt != totp)
				continue;
			int mnt = 0, mxt = 0, tot = 0;
			for (int i = 1; i <= m; i++) {
				if (res[i] == 1 && f[i] == 1)
					continue;
				if (res[i] == 1 && f[i] == 0) {
					if (t[i].typ != '?') {
						flag = 1;
						break;
					}
					else {
						mnt += 240 + 20 * (t[i].mn);
						mxt += 299 + 20 * (t[i].mx - 1);
						tot += t[i].mx - t[i].mn - 1;
					}
				}
				if (res[i] == 0 && t[i].typ == '+') {
					flag = 1;
					break;
				}
			}

			if (flag == 1)
				continue;
			// cout << mnt << " " << mxt << " " << rest << endl;
			if (mnt <= rest && rest <= mxt) {
				fff = 1;
				// cout << "FIND" << endl;
				int res1 = min(tot, (rest - mnt) / 20);
				int res2 = rest - mnt - res1 * 20;
				// cout << res1 << " " << res2 << endl;
				for (int i = 1; i <= m; i++) {
					if (res[i] == 0) {
						a[i] = t[i];
						if (a[i].typ == '?') {
							a[i].typ = '-';
							a[i].sub = t[i].mx;
						}
					}
					else {
						a[i] = t[i];
						if (a[i].typ == '?') {
							a[i].typ = '+';
							// cout << i << endl;
							int now = a[i].mx - a[i].mn - 1;
							if (res1 >= now) {
								res1 -= now;
								a[i].sub = a[i].mx;
							}
							else {
								a[i].sub = a[i].mn + res1 + 1;
								res1 = 0;
							}
							if (res2 > 0) {
								if (res2 <= 59) {
									a[i].tim = 240 + res2;
									res2 = 0;
								}
								else {
									a[i].tim = 299;
									res2 -= 59;
								}
							}
							else
								a[i].tim = 240;
						}
					}
				}
				break;
			}
		}
		if (fff == 0) {
			cout << "No" << endl;
			continue;
		}
		cout << "Yes" << endl;
		for (int i = 1; i <= m; i++) {
			cout << a[i].typ << " ";
			if (a[i].typ == '.') {
				cout << endl;
				continue;
			}
			if (a[i].typ == '-') {
				cout << a[i].sub << endl;
			}
			if (a[i].typ == '+') {
				cout << a[i].sub << '/' << a[i].tim << endl;
			}
		}
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cout.tie(nullptr);
	int T = 1;
	// cin >> T;
	while (T--) {
		solve();
	}
	return 0;
}