#include <bits/stdc++.h>

#define int long long
#define fadd(a,b,c) for (int a=b;a<=c;a++)
#define fsub(a,b,c) for (int a=b;a>=c;a--)
#define F first
#define S second
#define CYes cout << "Yes\n"
#define CNo cout << "No\n"
#define CYES cout << "YES\n"
#define CNO cout << "NO\n"
#define println(a) cout << (a) << '\n'

using namespace std;

typedef long long LL;
typedef pair<int,int> PII;
void fastIO(){ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);}
class bhscer {
public:
    template<typename FIRST, typename ...PACK> static void debug(FIRST first, PACK... params) { std::cout<< first <<' '; debug(params...);}
    template<typename T> static void debug(T end) { std::cout << end << std::endl; }
};
const int N = 5e5;
void solve() {
    string s; cin >> s;

    int n = s.size(); s = " " + s;
    string ne = " " + string(n, '*');

    auto fill = [&](PII rg) {
        auto [l,r] = rg;
        for (int i=l;i<=r;i++) {
            if (i == l || i > r-3) ne[i] = '>';
            else ne[i] = '-';
        }
    };


    // base checks
    if (s[1] == '-' || s[n] == '-' || s[n-1] == '-' || s[n-2] == '-') {
        CNo;
        return;
    }

    // we cover back first
    int j = n;
    while (j >= 1 && s[j] != '-') j --;
    if (j == 0) {
        CNo;
        return;
    }

    vector<PII> p1;
    for (int i=j;i<=n;i+=3) {
        // >--------------->>>|>>>|>>>
        // 1              i
        p1.push_back({1,min(n, i+3)});
    }
    reverse(p1.begin(), p1.end());
    for (auto rg: p1) {
        fill(rg);
    }


    for (int i=1;i<j;i++) {
        if (s[i+1] == '>') {
            // >>>--->>>--??----->>>>>>>>
            // i                j
            p1.push_back({i, j+3});
        } else {
            int k = i+1;
            while (k+1 <= j && s[k+1] == '-') k++;

            // >--------->>>?????
            // i        k
            p1.push_back({i, k+3});
            fill({i, k+3});
            i = k;
        }
    }

    cout << "Yes " << p1.size() << '\n';
    for (auto [l,r]: p1) {
        cout << l << ' ' << r-l+1 << '\n';
    }
    // cout << ne << '\n';
}
signed main() {
    fastIO();
    int _ = 1;
    cin >> _;
    while (_--) {
        solve();
    }

    return 0;
}