#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;
}
void solve()
{
	cin >> n >> m;
	for (int i = 1; i <= n; i++)
	{
		int cnt, pnt;
		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];
			}
		}
		pnt -= cnt * 240;
		if (pnt < 0)
		{
			cout << "No" << endl;
			continue;
		}
		int cntf = 0;

		for (int j = 1; j <= m; j++)
		{
			if (s[i][j] == "?")
			{
				cntf++;
				fp.push_back({ j,a[i][j][0],a[i][j][1] });
			}
		}
		sort(fp.begin(), fp.end(), cmp);
		if (cntf < cnt)
		{
			cout << "No" << endl;
			continue;
		}
		else
		{
			for (int j = 0; j < fp.size(); j++)
			{
				int tt = pnt / 20;
				if (cnt == 0) break;
				if (tt == 0 && fp[j].x != fp[j].y)
				{
					pnt = -1;
					cout << "No" << endl;
					break;
				}
				int sc = 240 + tt*20 + pnt % 20;
				if (tt <= fp[j].y)
				{
					s[i][fp[j].id] = "+";
					a[i][fp[j].id][0] = (tt==0?1:tt);
					a[i][fp[j].id][1] = 240 + (tt == 0 ? 0 : 1) * 20 + pnt % 20;
					pnt = 0;
					cnt--;
				}
				else
				{
					s[i][fp[j].id] = "+";
					a[i][fp[j].id][0] = fp[j].y;
					sc = 240 + fp[j].y * 20;
					int tmp = pnt - sc;
					tmp = min(tmp, 59ll);
					a[i][fp[j].id][1] = sc - fp[j].y * 20 + tmp;
					pnt -= fp[j].y * 20 + tmp;
					cnt--;
				}
			}
		}
		if ((pnt != 0 || cnt != 0)&&pnt!=-1)
		{
			cout << "No" << endl;
			continue;
		}
		else if (pnt != -1)
		{
			cout << "Yes" << endl;
			for (int j = 1; j <= m; j++)
			{
				if (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;
			}
		}
		
	}
	
	
}
signed main()
{
	std::ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
	int T = 1;
	//cin >> T;
	while (T--)
	{
		solve();
	}
	return 0;
}