#include <bits/stdc++.h>
// #include<bits/extc++.h>
#define endl '\n'
#define eps 1e-7
#define pb push_back
#define eb emplace_back
#define debug(x) cerr<<#x<<": "<<x<<'\n';
// using namespace __gnu_pbds;
using namespace std;
using ll = long long;
using ld = long double;
using pll = pair <ll,ll>;
using pii = pair <int,int>;
using ull = unsigned long long;
const int N = 1e3 + 5, M = 25, MOD = 1e9 + 7;
mt19937_64 rnd (chrono::steady_clock::now().time_since_epoch().count());
bool flag;
int n, m, pass, fashi, now, t;
array<int,3> info[M], ans[M];
vector <int> v;
void dfs(int u,int have) // 有have个，需要pass-now个
{
    if(u>m+1 || flag) return ;
    if(have==pass-now)
    {
        int mn = 0;
        for(auto idx:v)
        {
            auto [op,x,y] = info[idx];
            mn += 240 + (y-x)*20;
        } 
        // for(int i=1;i<=m;i++) ans[i] = info[i];
        if(t+mn<=fashi)
        {
            int d = fashi - (t+mn);
            for(auto idx:v)
            {
                auto [op,x,y] = info[idx];
                int bu = 299 + (y-1)*20 - (240 + (y-x)*20);
                if(d-bu>=0)
                {
                    d -= bu;
                    int g = min(x,bu/20+1);
                    ans[idx] = {0,y,299};
                }
                else
                {
                    int g = min(x,d/20+1);
                    ans[idx] = {0,y-x+g,240+d-(g-1)*20};
                    assert(240+d-(g-1)*20<=299);
                    d = 0;
                }
            }
            if(!d) flag = 1;
        }
        return ;
    }
    dfs(u+1,have);
    if(info[u][0]==2)
    {
        v.eb(u);
        dfs(u+1,have+1);
        v.pop_back();
    }
}
void isac()
{
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        cin>>pass>>fashi;
        now = 0, t = 0;
        for(int j=1;j<=m;j++)
        {
            char op[2];
            scanf("%s", op);
            if(op[0] == '+') 
            {
                info[j][0] = 0;
                scanf("%d/%d", &info[j][1], &info[j][2]);
                now ++;
                t += (info[j][1]-1)*20 + info[j][2];
            }
            else if(op[0] == '-') 
            {
                info[j][0] = 1;
                scanf("%d", &info[j][1]);
            }
            else if(op[0] == '?')
            { 
                info[j][0] = 2;
                scanf("%d%d", &info[j][1], &info[j][2]);
            }
            else info[j][0] = 3;
            ans[j] = info[j];
        } 
        int need = pass - now;
        if(need<0 || fashi<t) cout<<"No\n";
        else
        {
            v.clear();
            flag = 0;
            dfs(1,0);
            if(flag)
            {
                cout<<"Yes\n";
                for(int i=1;i<=m;i++)
                {
                    if(!ans[i][0]) cout<<"+ "<<ans[i][1]<<"/"<<ans[i][2]<<'\n';
                    else if(ans[i][0]==1) cout<<"- "<<ans[i][1]<<'\n';
                    else if(ans[i][0]==2) cout<<"- "<<ans[i][2]<<'\n';
                    else cout<<".\n";
                }
            }
            else cout<<"No\n";
        }
    }
}
int main(void)
{
    int T = 1;
    while (T--) isac();
    return 0;
}
/*
    Zena youth together.
    Such a pretty name.
    There will be a long story.
    fashi will tell all.
*/