#include<bits/stdc++.h>
using namespace std;
#define int long long
queue<pair<int,int>>a;
signed main(){
    int T;
    cin>>T;
    while(T--) {
        string s;
        cin>>s;
        int n=s.size();
        s=" "+s;
        //int gang=0;
        if(s[1]!='>'||s[n]!='>'||s[n-1]!='>'||s[n-2]!='>') {
            cout<<"No"<<endl;
        }

        else {
            int l=1;
            int bj=0;
            int bj_=0;
            for(int i=2;i<=n;i++){
                if(s[i]=='-') {
                    bj_=1;
                }
                if(bj_) {
                    if(s[i]=='>')bj++;
                    else {
                        bj=0;
                    }
                }
                int k=0;
                if(bj>=3) {
                    while(s[i+1]=='>'&&i<n)i++,bj++;
                    k=i;
                    while(bj>3) {
                        a.push({l,i-l+1});
                        bj-=3;
                        i-=3;
                    }
                    i += (3-bj);
                    for(;l<=i-4;l++) {
                        if(s[l]=='>') {
                            a.push({l,i-l+1});
                        }
                    }
                    l=k;
                    i=k;
                    bj_=0;
                    bj=0;
                }

            }
            if(a.empty()) {
                cout<<"No"<<endl;
            }
            else {
                cout<<"Yes "<<a.size()<<endl;
                while(!a.empty()) {
                    cout<<a.front().first<<" "<<a.front().second<<endl;
                    a.pop();
                }

            }
        }



    }
    return 0;
}