#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
int read()
{
    int x;cin>>x;
    return x;
}
int n,m,cnt,sum,A[20],B[20];
char s[10000],ans[20];
vector<int>a,b,pos;
void work()
{
	scanf("%d%d",&cnt,&sum);

	a.clear();
	b.clear();
	pos.clear();
	for(int i=1;i<=m;i++)
	{
		scanf("%s",s);
		if(s[0]=='+')
		{
			int ta,tb;
			scanf("%s",s);
			sscanf(s,"%d/%d",&ta,&tb);
			cnt--;
			sum=sum-tb-(ta-1)*20;
			ans[i]='+';
			A[i]=ta;
			B[i]=tb;
		}
		else if(s[0]=='?')
		{
			ans[i]='?';
			int ta,tb;
			scanf("%d %d",&ta,&tb);
			a.push_back(ta);
			b.push_back(tb);
			pos.push_back(i);
		}
		else if(s[0]=='.')
		{
			ans[i]='.';
			continue;
		}
		else if(s[0]=='-')
		{
			ans[i]='-';
			scanf("%d",&B[i]);
		}
	}
	for(int now=0;now<(1<<a.size());now++)
	{
		int tcnt=0;
		for(int i=0;i<a.size();i++)
			if(now&(1<<i))
				tcnt++;
		if(tcnt!=cnt)
			continue;
		int l=0,r=0;
		for(int i=0;i<a.size();i++)
		{
			if(now&(1<<i))
			{
				ans[pos[i]]='+';
				l=l+20*(b[i]-a[i])+240;
				r=r+20*(b[i]-1)+299;
			}
			else
			{
				ans[pos[i]]='-';
				B[pos[i]]=b[i];
			}
		}
		if(l<=sum&&sum<=r)
		{
			cout<<"Yes\n";
			for(int i=0;i<a.size();i++)
			{
				if(now&(1<<i))
				{
					A[pos[i]]=b[i]-a[i]+1;
					B[pos[i]]=240;
					sum=sum-20*(A[pos[i]]-1)-240;
				}
			}
			for(int i=0;i<a.size()&&sum>0;i++)
			{
				int t=max(0,min(sum/20,a[i]-1));
				sum=sum-20*t;
				A[pos[i]]+=t;
				if(sum>=59)
				{
					sum-=59;
					B[pos[i]]=299;
				}
				else
				{
					B[pos[i]]=240+sum;
					sum=0;
					break;
				}
			}
			// sum=0;
			for(int x=1;x<=m;x++)
			{
				if(ans[x]=='+'){
					printf("+ %d/%d\n",A[x],B[x]);
					sum=sum+B[x]+(A[x]-1)*20;
				}
				else if(ans[x]=='-')
					printf("- %d\n",B[x]);
				else if(ans[x]=='.')
					printf(".\n");
			}
			return ;
		}
	}
	cout<<"No\n";
}
int main()
{
	// freopen("1.in","r",stdin);
	n=read();m=read();
	for(;n;n--)
	{
		work();
	}
}