#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long long LL;
typedef pair<ll, ll>pll;
#define endl '\n'
#define per(i, a, b) for(int i = (a); i >= (b); i--)
#define rep(i, a, b) for(int i = (a); i <= (b); i++)
#define maxn 64
typedef pair<int,int> PII;
#define debug(x) cout<<#x<<": "<<x<<endl
int t;

void solve()
{
    ll n,m;
	cin>>n>>m;
	char op[t+1];
	string s[t+1];
	vector<array<int,3>>path;
	unordered_map<int,int>yy;
	for(int i=1;i<=t;i++)
	{
		cin>>op[i];
		if(op[i]=='.') continue;
		else if(op[i]=='+')
		{
			n--;
			cin>>s[i];
			int num=0;
			int sov,time;
			for(int j=0;j<s[i].length();j++)
			{
				if(s[i][j]=='/')
				{
					sov=num;
					num=0;
				}
				else num=num*10+s[i][j]-'0';
			}
			m-=(sov-1)*20;
			time=num;
			m-=time;
		}
		else if(op[i]=='-')
		{
			cin>>s[i];
		}
		else 
		{
			int x,y;
			cin>>x>>y;
			yy[i] = y;
			path.push_back({i,x,y});
		}
	}
	int cnt=path.size();
	int k=1<<(path.size());
	for(int i=0;i<k;i++)
	{
		unordered_map<int,int>mp,mp2;
		if(__builtin_popcountll(i)!=n) continue;
		vector<array<int,3>>now;
		for(int j=0;j<cnt;j++)
		{
			if((i>>j)&1) now.push_back(path[j]);
		}
		ll mm=m;
		ll have=0;
		for(auto [id,x,y]:now)
		{
			mp[id]=x;
			mp2[id]=y-x;
			mm-=(y-x)*20;
			have+=x-1;
		}
		ll l=mm-299*n;
		ll r=mm-240*n;
		//l<=[0,have]*20<=r
		ll l1 = 0, r1 = have;
		while(l1 < r1) {
			ll mid = (l1 + r1 + 1) >> 1;
			if(mid * 20 <= r) l1 = mid;
			else r1 = mid - 1;
		}
		mm = mm - (l1 * 20);
		mm -= 240 * n;
		if(l1 * 20 >= l && l1 * 20 <= r) 
		{
			cout<<"Yes"<<endl;
			for(int j=1;j<=t;j++)
			{
				if(op[j]=='+')
				{
					cout<<"+ "<<s[j]<<endl;
				}
				else if(op[j]=='.')
				{
					cout<<"."<<endl;
				}
				else if(op[j]=='-')
				{
					cout<<"- "<<s[j]<<endl;
				}
				else
				{
					if(mp[j])
					{
						cout<<"+ ";
						if(l1)
						{
							// debug(mp2[j]);
							// debug(mp[j]);
							cout<<mp2[j]+min((int)(l1+1),mp[j]);
							cout<<'/';
							l1-=min((int)(l1+1),mp[j]) - 1;
						}
						else
						{
							cout<<mp2[j]+1;
							cout<<'/';
						}
						if(mm>=59)
						{
							cout<<299<<endl;
							mm-=59;
						}
						else
						{
							cout<<mm + 240<<endl;
							mm=0;
						}
					} 
					else
					{
						cout<<"- "<<yy[j]<<endl;
					}
					
				}
			}

			return;
		}
	}
	cout<<"No"<<endl;
}

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

	int T=1;
	cin>>T;
	cin>>t;
	while(T--)
	{
		solve();
	}
	return 0;
}