#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> PII;

void solve()
{
    string s;
    cin >> s;
    int n = s.size();

    if(count(s.begin(), s.end(), '>') == n)
    {
        cout << "No" << endl;
        return;
    }

    if(s[0] != '>' || s.substr(n - 3, 3) != ">>>")
    {
        cout << "No" << endl;
        return;
    }

    vector<PII> ans;

    int ed = n - 1;
    while(ed > 0 && s[ed] == '>') ed --;

    if(ed < n - 1 - 3)
    {
        for(int i = n - 1; i > ed; )
        {
            int st;
            if(i - ed >= 3) st = i - 3;
            else st = ed;

            // cout << st - 1 << ' ' << i + 1 << endl;
            ans.push_back({st, 5});
            i = st;
        }
    }

    n = ed + 1;

    // cout << n << endl;

    int i = 0;
    while(i < n)
    {
        int j = i + 1;
        while(j < n && s[j] == '-') j ++;

        if(j == i + 1)
        {
            // cout << i + 1 << ' ' << i + 5 << endl;
            ans.push_back({i + 1, 5});
            i = j; 
        }
        else
        {
            // cout << i + 1 << ' ' << j + 3 << endl;
            ans.push_back({i + 1, j - i + 3});
            i = j;
        }
    }

    cout << "Yes" << ' ' << ans.size() << endl;
    for(auto t : ans)
        cout << t.first << ' ' << t.second << endl;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);

    int t = 1;
    cin >> t;
    while(t --)
        solve();

    return 0;
}

/*

4
>>->>>
>>>->
>>>>>
>->>>>>>

*/