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

int ac, tim;
char sta[20];
int n, m, x[20], y[20], id[20], tot, ord[20];

bool dfs(int last, int d) {
	if (d == ac) {
		int tmp = tim;
		int ct = 0;	//可控提交
		for (int i = 0; i < d; i++) {
			int o = ord[i];
			tmp -= (y[o] - x[o]) * 20;	//罚时
			ct += x[o] - 1;
		}
		
		if (tmp < ac * 240) return false;
		
		int dif, cnt = 0;
		
		if (tmp > ac * 299) {
			int need = (tmp - ac * 299 + 19) / 20;
			if (need > ct) return false;
			tmp -= need * 20;
			cnt = need;
		}
		dif = tmp - ac * 240;
		
		for (int i = 0; i < d; i++) {
			int o = ord[i];
			sta[o] = '+';
			int a = min(x[o] - 1, cnt);
			int b = min(dif, 59);
			x[o] = (y[o] - x[o] + 1 + a);
			y[o] = 240 + b;
			cnt -= a;
			dif -= b;
		}
		
		return true;
	}
	for (int i = last; i < tot; i++) {
		ord[d] = id[i];
		if (dfs(i + 1, d + 1)) return true;
	}
	return false;
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i++) {
		cin >> ac >> tim;
		tot = 0;
		for (int j = 1; j <= m; j++) {
			char ch;
			cin >> ch;
			sta[j] = ch;
			if (ch == '.') ;
			else if (ch == '+') {
				cin >> x[j] >> ch >> y[j];
				ac--;	//过题数 
				tim -= (x[j] - 1) * 20 + y[j];	//罚时
			} else if (ch == '-') {
				cin >> x[j];
			} else {
				cin >> x[j] >> y[j];
				id[tot++] = j;
			}
		}
		
		if (ac < 0 || ac > tot || tim < ac * 240) {
			cout << "No\n";
			continue ;
		}
		
		if (!dfs(0, 0)) cout << "No\n";
		else {	
			//输出答案
			cout << "Yes\n";
			for (int i = 1; i <= m; i++) {
				if (sta[i] == '.') cout << '.';
				else if (sta[i] == '+') {
					cout << "+ " << x[i] << '/' << y[i];
				} else if (sta[i] == '-') {
					cout << "- " << x[i];
				} else {
					cout << "- " << y[i];
				}
				cout << '\n';
			} 
		}
	}
}

signed main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	solve();
	return 0;
}