#include <bits/stdc++.h>
using namespace std;
#define xx first
#define yy second
#define endl "\n"
#define pb push_back
#define int long long
#define ll long long
#define lowbit(x) x & (-x)
typedef pair<int, int> pii;
#define LF(x) fixed << setprecision(x)
#define Yshanqian ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
const int N = 1e6 + 10, M = 1010, inf = 0x3f3f3f3f, mod = 1e9 + 7, P = 13331;
int n, m;
struct node
{
    char op;
    int a = 0, b = 0;
} a[20];
void solve()
{
    cin >> n >> m;
    for (int i = 1; i <= n; i++)
    {
        int ac = 0, tot = 0;
        int nowac = 0, nowtot = 0;
        cin >> ac >> tot;

        vector<pair<node, int>> t;
        for (int j = 1; j <= m; j++)
        {
            char ch, op;
            int x, y;
            cin >> op;
            if (op == '+')
            {
                cin >> x >> ch >> y;
                a[j] = {op, x, y};
                nowac++, nowtot += (x - 1) * 20 + y;
            }
            else if (op == '-')
            {
                cin >> x;
                a[j] = {op, x};
            }
            else if (op == '?')
            {
                cin >> x >> y;
                a[j] = {op, x, y};
                t.pb({a[j], j});
            }
            else
            {
                a[j] = {op};
            }
        }

        int x1 = ac - nowac, y1 = tot - nowtot;

        int sz = t.size();
        bool f = 0;
        for (int j = 0; j < (1 << sz); j++)
        {
            int s = 0, sum = 0;
            vector<bool> st(14);
            int res = 0;
            for (int k = 0; k < sz; k++)
            {
                if (j >> k & 1)
                {
                    s++;
                    sum += (t[k].xx.b - t[k].xx.a) * 20;
                    st[t[k].yy] = 1;
                    res += t[k].xx.a - 1;
                }
            }
            if (x1 != s)
                continue;

            int cnt = 0;
            if (y1 - sum <= x1 * 299)
                cnt = 0;
            else
                cnt = (y1 - sum - x1 * 299 + 19) / 20;

            if (cnt > res || y1 - sum < x1 * 240)
                continue;
            cout << "Yes" << endl;
            int ave = 0, yu = 0;
            if (x1)
            {
                ave = (y1 - sum - cnt * 20) / x1;
                yu = (y1 - sum - cnt * 20 - ave * x1);
            }

            for (int k = 1; k <= m; k++)
            {
                auto [op, x, y] = a[k];
                if (op == '+')
                    cout << "+ " << x << '/' << y << endl;
                else if (op == '.')
                    cout << ".\n";
                else if (op == '-')
                    cout << "- " << x << endl;
                else
                {
                    if (st[k] == 0)
                        cout << "- " << y << endl;
                    else
                    {
                        int mn1 = min(cnt, a[k].a - 1);
                        int mn2 = min(299 - ave, yu);
                        cnt -= mn1, yu -= mn2;
                        cout << "+ " << mn1 + a[k].b - a[k].a + 1 << "/" << ave + mn2 << endl;
                    }
                }
            }
            f = 1;
            break;
        }
        if (f == 0)
            cout << "No" << endl;
    }
}
signed main()
{
    Yshanqian;
    int T;
    T = 1;
    // cin >> T;
    for (int cases = 1; cases <= T; ++cases)
    {
        // cout<<"Case #"<<cases<<": ";
        solve();
    }
    return 0;
}