#include <bits/stdc++.h>
#define dug(x) cerr << "死了吧小丑" << x << endl
using namespace std;
using i64 = long long;
template <class T> void chmax(T &a, T b)
{
    a > b ? (a = a) : (a = b);
}
template <class T> void chmin(T &a, T b)
{
    a > b ? (a = b) : (a = a);
}
int m;
void solve()
{
    int hasti, hastime;
    cin >> hasti >> hastime;
    int ingn = 0, ingm = 0;
    vector<int> ta, tb, xu;
    vector<string> fl(m);
    vector<string> has(m);
    for (int i = 0; i < m; i++)
    {
        cin >> fl[i];
        if (fl[i] == "?")
        {
            int a, b;
            cin >> a >> b;
            ta.push_back(a);
            tb.push_back(b - a);
            xu.push_back(i);
        }
        else if (fl[i] == "+")
        {
            ingn++;
            cin >> has[i];
            int si = 0;
            for (auto c : has[i])
            {
                if (c == '/')
                {
                    ingm += (si - 1) * 20;
                    si = 0;
                }
                else
                    si = si * 10 + c - '0';
            }
            ingm += si;
        }
        else if (fl[i] == "-")
        {
            cin >> has[i];
        }
    }
    bool flag = false;
    vector<int> st(xu.size());
    function<void(int)> dfs = [&](int idx) {
        if (flag)
            return;
        if (idx == xu.size())
        {
            int cnt = 0;
            for (auto c : st)
            {
                cnt += c;
            }
            if (ingn + cnt != hasti)
                return;
            int minn = ingm, mmax = ingm;
            cnt = 0;
            for (int i = 0; i < xu.size(); i++)
            {
                if (st[i])
                {
                    minn += 240 + 20 * tb[i];
                    mmax += 299 + 20 * tb[i];
                    cnt += ta[i] - 1;
                }
            }
            if (hastime >= minn && hastime <= mmax)
            {
                cout << "Yes" << endl;
                int ingtime = minn;
                vector<int> need(xu.size());
                for (int i = 0; i < xu.size(); i++)
                {
                    if (!st[i])
                        continue;
                    if (hastime - ingtime < 59)
                    {
                        need[i] = hastime - ingtime;
                        ingtime += hastime - ingtime;
                    }
                    else
                    {
                        ingtime += 59;
                        need[i] = 59;
                    }
                }
                int idx = 0;
                for (int i = 0; i < m; i++)
                {
                    if (fl[i] != "?")
                    {
                        cout << fl[i];
                        if (fl[i] != ".")
                        {
                            cout << " " << has[i];
                        }
                    }
                    else
                    {
                        if (st[idx])
                        {
                            cout << "+ ";
                            cout << tb[idx] + 1 << "/";
                            cout << need[idx] + 240;
                        }
                        else
                        {
                            cout << "- ";
                            cout << ta[idx] + tb[idx];
                        }
                        idx++;
                    }
                    cout << '\n';
                }
            }
            else if (hastime < minn)
            {
                return;
            }
            else
            {
                int siz = (hastime - mmax - 1) / 20 + 1;
                if (siz > cnt)
                {
                    return;
                }
                vector<int> cnr(xu.size());
                int ingtime = hastime - 20 * siz;
                if (ingtime < minn)
                {
                    return;
                }
                cout << "Yes" << endl;
                ingtime = minn + 20 * siz;
                for (int i = 0; i < xu.size(); i++)
                {
                    if (!st[i])
                        continue;
                    int re = min(ta[i] - 1, siz);
                    cnr[i] = re;
                    siz -= re;
                }
                vector<int> need(xu.size());
                for (int i = 0; i < xu.size(); i++)
                {
                    if (!st[i])
                        continue;
                    if (hastime - ingtime < 59)
                    {
                        need[i] = hastime - ingtime;
                        ingtime += hastime - ingtime;
                    }
                    else
                    {
                        ingtime += 59;
                        need[i] = 59;
                    }
                }

                int idx = 0;
                for (int i = 0; i < m; i++)
                {
                    if (fl[i] != "?")
                    {
                        cout << fl[i];
                        if (fl[i] != ".")
                        {
                            cout << " " << has[i];
                        }
                    }
                    else
                    {
                        if (st[idx])
                        {
                            cout << "+ ";
                            cout << tb[idx] + 1 + cnr[idx] << '/';
                            cout << need[idx] + 240;
                        }
                        else
                        {
                            cout << "- ";
                            cout << ta[idx] + tb[idx];
                        }
                        idx++;
                    }
                    cout << '\n';
                }
            }
            flag = true;
            return;
        }
        dfs(idx + 1);
        st[idx] = 1;
        dfs(idx + 1);
        st[idx] = 0;
    };
    dfs(0);
    if (!flag)
        cout << "No" << '\n';
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(15) << fixed;
    int t;
    cin >> t;
    cin >> m;
    while (t--)
    {
        solve();
    }
    return 0;
}