#include <iostream>
#include <cctype>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
template<typename T> void cmax(T &a,const T &b){if(a<b)a=b;}
template<typename T> void cmin(T &a,const T &b){if(b<a)a=b;}

const int N=1005;
int n,m,a,b;
char op[N];
int x[N],y[N];

int gb(int x,int i){return (x>>i)&1;}

void fmain(){
	cin>>n>>m;
	while(n--){
		cin>>a>>b;
		for(int i=0;i<m;++i){
			cin>>op[i];
			if(op[i]!='.'){
				cin>>x[i];
				if(op[i]!='-'){
					cin.get();
					cin>>y[i];
				}
			}
		}
		bool f=false;
		for(int S=0;S<(1<<m);++S){
			if(__builtin_popcount(S)!=a)
				continue;
			bool flg=false;
			for(int i=0;i<m;++i)
				if((gb(S,i) && (op[i]=='-' || op[i]=='.')) || (!gb(S,i) && op[i]=='+')){
					flg=true;
					break;
				}
			if(flg)
				continue;
			int mn=0,mx=0;
			for(int i=0;i<m;++i){
				if(!gb(S,i))
					continue;
				if(op[i]=='+'){
					mn+=(x[i]-1)*20+y[i];
					mx+=(x[i]-1)*20+y[i];
				}else{ // ?
					mn+=(y[i]-x[i])*20+240;
					mx+=(y[i]-1)*20+299;
				}
			}
			if(!(mn<=b && b<=mx))
				continue;
			int p=b-mn;
			cout<<"Yes\n";
			for(int i=0;i<m;++i){
				if(op[i]=='.'){
					cout<<".\n";
				}else if(op[i]=='-'){
					cout<<"- "<<x[i]<<'\n';
				}else if(op[i]=='+'){
					cout<<"+ "<<x[i]<<'/'<<y[i]<<'\n';
				}else if(gb(S,i)){
					if((x[i]-1)*20+59<=p){
						cout<<"+ "<<y[i]<<"/299\n";
						p-=(x[i]-1)*20+59;
					}else{
						int o=y[i]-x[i];
						while(p>=20 && o<=y[i]-1){
							++o;
							p-=20;
						}
						cout<<"+ "<<(o+1)<<'/'<<(240+p)<<'\n';
					}
				}else{
					cout<<"- "<<y[i]<<'\n';
				}
			}
			f=true;
			break;
		}
		if(!f)
			cout<<"No\n";
	}
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(nullptr),cout.tie(nullptr);
	fmain();
	return 0;
}