#include<bits/stdc++.h>
#define ll long long
using namespace std;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    if (s[0] == '-' || s[n-1] == '-' || s[n-2] == '-' || s[n-3] == '-') {
        cout << "No\n";
        return;
    }
    int lst = 0, mark = 0, ml = 0, mr = 0;
    vector <array<int, 2> > vp;
    for (int i = 0; i + 3 < n; i++) {
        if (s[i] == '-' && s[i+1] == '>') {
            mark = 1;
            vp.push_back({lst, i + 4 - lst});
            mr = i + 2;
        } else if (s[i] == '>') {
            lst = i;
            if (i + 4 < n) vp.push_back({i, 5});
        }
    }
    if (!mark) {
        cout << "No\n";
        return;
    }
    vp.resize(unique(vp.begin(), vp.end()) - vp.begin());
    while (vp.back()[0] + 2 > mr) vp.pop_back();
    string ss = string(n, '*');
    vector <array<int, 2> > v;
    {
        for (int i = mr; i < n; i += 3) {
            if (i + 4 < n) {
                v.push_back({i, 5});
            } else {
                v.push_back({n - 5, 5});
                break;
            }
        }
        std::reverse(v.begin(), v.end());
    }

    cout << "Yes " << vp.size() + v.size() << '\n';
    for (auto[a, b] : v) {
        cout << a + 1 << ' ' << b << '\n';
        ss[a] = ss[a + b - 1] = ss[a + b - 2] = ss[a + b - 3] = '>';
        for (int i = a + 1; i < a + b - 3; i++) {
            ss[i] = '-';
        }
//        cout << ss << '\n';
    }
    for (auto[a, b] : vp) {
        cout << a + 1 << ' ' << b << '\n';
        ss[a] = ss[a + b - 1] = ss[a + b - 2] = ss[a + b - 3] = '>';
        for (int i = a + 1; i < a + b - 3; i++) {
            ss[i] = '-';
        }
//        cout << ss << '\n';

    }
//    if (ss != s) {
//        cout << "? " << ss << '\n';
//    }
}

int main( )
{
    int T;
    cin >> T;
    while (T--) {
        solve();
    }

    return 0;

}