#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    int T; cin >> T;
    while(T--){
        string s; cin >> s;
        int n = s.size();
        if(s[0] == '-' || s[n-1] == '-' || s[n-2] == '-' || s[n-3] == '-'){
            cout << "No\n";
            continue;
        }
        int j = n-1;
        while(j && s[j] != '-') j--;
        if(s[j] != '-'){
            cout << "No\n";
            continue;
        }
        cout << "Yes ";
        deque<pair<int, int>> ans;
        string t(n, '*');
        auto update = [&](auto&p){
            return ;
            auto[l, r] = p;
            for(int i=l; i<=r; i++){
                if(i == l || i >= r-2){
                    t[i] = '>';
                }else{
                    t[i] = '-';
                }
            }
        };
        for(int i=j; i<n; i+=3){
            ans.emplace_front(0, min(n-1, i+3));
            update(ans.front());
        }
        for(int i=0; i<j; i++){
            int k = i+1;
            if(s[k] != '-'){
                ans.emplace_back(i, j+3);
                update(ans.back());
            }else{
                while(k <= j && s[k+1] == '-') k++;
                ans.emplace_back(i, k+3);
                update(ans.back());
                i = k;
            }
        }

        // if(t != s){
        //     cerr << "FUCK: " << t << endl;
        //     *(int*)nullptr = false;
        // }

        cout << ans.size() << '\n';
        for(auto[l, r] : ans){
            cout << l + 1 << ' ' << (r - l + 1) << '\n';
            // cout << l + 1 << ' ' << r + 1 << '\n';
        }
    }

    return 0;
}