#include<bits/stdc++.h>
using namespace std;
const long long inf = 1e18 + 10;
const int inf1 = 1e9 + 10;
#define int long long
#define dbl long double
#define endl '\n'
#define sc second
#define fr first
#define mp make_pair
#define pb push_back
#define all(x) x.begin(), x.end()
mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());
const int maxn = -1;


void solve() {
    string s;
    cin >> s;
    vector<pair<int,int>> p;
    for(int i = 0; i < s.size(); i++) {
        if(p.size() && s[i] == s[i-1]) {
            p.back().sc = i;
        }
        else {
            p.pb(mp(i,i));
        }
    }

    if(s[0] == '-' or s.back() == '-' or p.back().sc-p.back().fr+1 < 3 or p.size() == 1) {
        cout << "No" << endl;
        return;
    }

    vector<pair<int,int>> ans;

    // 11111111
    // 1111100010111111

    // 11111100
    // 111100001111\

    // 110111
    // ******
    // 101111
    for(int i = 0; i < p.size(); i+= 2) {
        // so 1
        if(i != 0 and p[i].sc-p[i].fr+1 >= 5) {
            for(int r = p[i].sc; r-4 >= p[i].fr; r--) {
                int l = r-4;
                ans.pb(mp(l,r));
            }
        }
        else if(i != (int) p.size()-1) {
            for(int j = p[i].fr; j <= p[i].sc-1; j++) {
                if(j+4 < (int) s.size()) ans.pb(mp(j,j+4));
            }
        }
        else if(p[i].sc-p[i].fr+1 == 4) {
            ans.pb(mp(p[i].fr-1,p[i].fr+3));
        }


        // so s[p.back().fr+1] = 0, resto é 1
    }

    //11110000111111
    for(int i = 0; i+2 < p.size(); i+= 2) {
        ans.pb(mp(p[i].sc,p[i+2].fr+2));
    }

    cout << "Yes " << ans.size() << endl;
    for(auto x : ans) {
        cout << x.fr+1 << " " << x.sc-x.fr+1 << endl;
    }


}

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

    #ifndef ONLINE_JUDGE
    freopen("in.in", "r", stdin);
    freopen("out.out", "w", stdout);
    #endif

    int tt = 1;
    cin >> tt;
    while(tt--) {
        solve();
    }

}