#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int MX=1010;

int N, M;
int read()
{
    int r=0, f=1; char ch=getchar();
    while(ch<'0'||ch>'9') {if(ch=='-') f=-1; ch=getchar();}
    while(ch>='0'&&ch<='9') {r=r*10+ch-'0'; ch=getchar();}
    return r*f;
}
struct prob
{
    int time, tries, l, r, tpe, limtry;  
    int ftries, ftime, ftpe;
};
struct node
{
    int id, l, r;
};
bool cmpl(node a, node b)
{
    return a.l<b.l;
}
struct team
{
    int solved, time, bsol, bt, br, bw;
    prob q[14];
    node stac[14]; int top;
}t[MX];
int main()
{
    // freopen("testdata.in","r",stdin);
    N=read(); M=read();
    for(int i=1;i<=N;i++)
    {
        t[i].solved=read();
        t[i].time=read();
        for(int j=1;j<=M;j++)
        {
            int x, y;
            char opt; cin >> opt;
            if(opt=='+')
            {
                x=read(); y=read();
                t[i].q[j].ftpe=1;
                t[i].q[j].ftime=y;
                t[i].q[j].ftries=x;
                t[i].bsol++;
                t[i].bt+=max(0,x-1)*20+y;
            }
            if(opt=='?')
            {
                x=read(); y=read(); 
                t[i].q[j].tpe=2;
                t[i].q[j].time=(y-x)*20;
                t[i].q[j].tries=y-x;
                t[i].q[j].limtry=y;
                int &l=t[i].q[j].l=max(0,y-x)*20+240;
                int &r=t[i].q[j].r=max(0,y-1)*20+299;
                t[i].bw++; t[i].br+=t[i].q[j].r;
                t[i].stac[++t[i].top]={j,l,r};
            }
            if(opt=='-')    //useless
            {
                x=read();
                t[i].q[j].ftpe=3;
                t[i].q[j].ftries=x;
            }
            if(opt=='.') t[i].q[j].ftpe=4;   //usesless
        }
    }
    for(int i=1;i<=N;i++)
    {
        if(t[i].bsol+t[i].bw<t[i].solved) {cout << "No\n"; continue;}
        if(t[i].bsol>t[i].solved) {cout << "No\n"; continue;}
        int lim=t[i].top, tag=0;
        int nd=t[i].time-t[i].bt;
        for(int now=0;now<(1<<lim);now++)
        {
            if(__builtin_popcount(now)!=t[i].solved-t[i].bsol) continue;
            int res=nd;
            for(int p=1;p<=lim;p++)
            {
                if(!((1<<(p-1))&now)) continue;
                int id=t[i].stac[p].id;
                res-=t[i].q[id].l;
            }
            if(res<0) continue;
            // cout << "res=" << res << '\n';
            for(int p=1;p<=lim;p++)
            {
                if(!((1<<(p-1))&now)) continue;
                int id=t[i].stac[p].id;
                int gap=min(res,t[i].q[id].r-t[i].q[id].l);
                // cout << "gap=" << gap << '\n';
                if(gap>=60) t[i].q[id].ftries=t[i].q[id].tries+(gap-40)/20+1;
                else t[i].q[id].ftries=t[i].q[id].tries+1;
                t[i].q[id].ftime=t[i].q[id].l+gap-max(0,t[i].q[id].ftries-1)*20;
                t[i].q[id].ftpe=1;
                res-=gap;
            }
            if(res>0) continue;
            else
            {
                for(int p=1;p<=lim;p++)
                {
                    int id=t[i].stac[p].id;
                    if(!((1<<(p-1))&now))
                        t[i].q[id].ftpe=3, t[i].q[id].ftries=t[i].q[id].limtry;
                }
                tag=1; break;
            }
        }
        if(!tag) {cout << "No\n"; continue;}
        cout << "Yes\n";
        for(int j=1;j<=M;j++)
        {
            if(t[i].q[j].ftpe==1) cout << "+ " << t[i].q[j].ftries << "/" << t[i].q[j].ftime << '\n';
            if(t[i].q[j].ftpe==3) cout << "- " << t[i].q[j].ftries << '\n';
            if(t[i].q[j].ftpe==4) cout << ". \n";
        }
    }   
    return (0-0);
}