#include<iostream>
#include<algorithm>
#include<cstring>
#include<map>
#include<set>
#include<stack>
#include<vector>
using namespace std;
#define int long long
#define endl '\n'
typedef pair<int, int> pii;
const int N = 1e3 + 10;
const int mod = 998244353;
int n, m;
string s[N][15];
int a[N][15][2];
struct P
{
	int id, x, y;
};
bool cmp(P a, P b)
{
	return a.x < b.x;
}
vector<P>fp;
int str2int(string s)
{
	int res = 0;
	for (auto c : s)
	{
		res = res * 10 + (c - '0');
	}
	return res;
}
int cnt, pnt;
int dfs(int idx,int u)
{
	
	if (u == fp.size())
	{
		if (cnt != 0) return 0;
		for (int i = 0; i < u; i++)
		{
			if (s[idx][fp[i].id] == "!")
			{
				a[idx][fp[i].id][1] = 240 + min(59ll, pnt);
				pnt -= min(59ll, pnt);
			}
		}
		if (pnt != 0) return 0;
		return 1;
	}
	if (pnt - 20 * (fp[u].y - fp[u].x) < 0||cnt==0) return dfs(idx, u + 1);
	for (int i = 0; i <= fp[u].x; i++)
	{
		if (i)
		{
			int t = pnt;
			pnt -= 20 * (fp[u].y - fp[u].x + i-1);
			if (pnt < 0)
			{
				pnt = t;
				break;
			}
			cnt--;
			s[idx][fp[u].id] = "!";
			a[idx][fp[u].id][0] = i + fp[u].y - fp[u].x;
			if (dfs(idx, u + 1)) return 1;
			a[idx][fp[u].id][0] = fp[u].x;
			a[idx][fp[u].id][0] = fp[u].y;
			s[idx][fp[u].id] = "?";
			cnt++;
			pnt = t;
		}
		if (dfs(idx, u + 1)) return 1;
	}
	return 0;
}
void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		if (i == 15)
		{
			cin >> cnt >> pnt;
			cout << cnt << "!" << pnt;
			for (int j = 1; j <= m; j++)
			{
				cin >> s[i][j];
				cout << s[i][j];
				if (s[i][j] == "+")
				{
					string tmp;
					cin >> tmp;
					cout << tmp;
					string x;
					string y;
					int flag = 0;
					for (auto c : tmp)
					{
						if (c == '/')
						{
							flag = 1;
							continue;
						}
						if (flag) y += c;
						else x += c;
					}
					a[i][j][0] = str2int(x);
					a[i][j][1] = str2int(y);
					pnt -= a[i][j][1] + 20 * (a[i][j][0] - 1);
					cnt--;
				}
				else if (s[i][j] == "?")
				{
					string x;
					string y;
					cin >> x >> y;
					cout << x << "!" << y;
					a[i][j][0] = str2int(x);
					a[i][j][1] = str2int(y);
				}
				else if (s[i][j] == "-")
				{
					cin >> a[i][j][1];
					cout << a[i][j][1];
				}
			}
		}
		else
		{
			pnt = cnt = 0;
			fp.clear();
			cin >> cnt >> pnt;
			for (int j = 1; j <= m; j++)
			{
				cin >> s[i][j];
				if (s[i][j] == "+")
				{
					string tmp;
					cin >> tmp;
					string x;
					string y;
					int flag = 0;
					for (auto c : tmp)
					{
						if (c == '/')
						{
							flag = 1;
							continue;
						}
						if (flag) y += c;
						else x += c;
					}
					a[i][j][0] = str2int(x);
					a[i][j][1] = str2int(y);
					pnt -= a[i][j][1] + 20 * (a[i][j][0] - 1);
					cnt--;
				}
				else if (s[i][j] == "?")
				{
					string x;
					string y;
					cin >> x >> y;
					a[i][j][0] = str2int(x);
					a[i][j][1] = str2int(y);
				}
				else if (s[i][j] == "-")
				{
					cin >> a[i][j][1];
				}
			}
			if (pnt - 240 * cnt < 0)
			{
				cout << "No" << endl;
				continue;
			}
			pnt -= 240 * cnt;
			for (int j = 1; j <= m; j++)
			{
				if (s[i][j] == "?")
				{
					int tmp = pnt - 20 * (a[i][j][1] - a[i][j][0]);
					if (tmp >= 0)
					{
						fp.push_back({ j,a[i][j][0],a[i][j][1] });
					}
				}
			}
			if (fp.size() < cnt)
			{
				cout << "No" << endl;
				continue;
			}
			if (dfs(i, 0))
			{
				cout << "Yes" << endl;
				for (int j = 1; j <= m; j++)
				{
					if (s[i][j] == "+" || s[i][j] == "!")
					{
						cout << "+ " << a[i][j][0] << "/" << a[i][j][1] << endl;
					}
					else if (s[i][j] == "?" || s[i][j] == "-")
					{
						cout << "- " << a[i][j][1] << endl;
					}
					else cout << "." << endl;
				}
			}
			else
			{
				cout << "No" << endl;
			}
		}
		
	}
	
	
}
signed main()
{
	std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	//cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}