#include<bits/stdc++.h>
using namespace std;
#define int long long 
#define endl "\n"
#define rep(i,j,k) for(int i = (j) , _i = (k) ; i <= _i ; i ++ )
#define drp(i,j,k) for(int i = (j) , _i = (k) ; i >= _i ; i -- )

const int N=1e6+5;
struct ANS{
    pair<int,int> sta1[N],sta2[N];
    int top1,top2;
    void priopush(int x,int y) {
        sta2[++top2]=make_pair(x,y);
    }
    void push(int x,int y) {
        sta1[++top1]=make_pair(x,y);
    }
    void flush() {
        cout<<top1+top2<<endl;
        rep(i,1,top2) {
            cout<<sta2[i].first<<" "<<sta2[i].second-sta2[i].first+1<<endl;
        }
        top2=0;
        while(top1) {
            cout<<sta1[top1].first<<" "<<sta1[top1].second-sta1[top1].first+1<<endl;
            top1--;
        }
    }
}ans;

void solve() 
{
    string s ;
    cin >> s ;
    int n = s.size () ;
    s = " " + s ; 
    if(s[1]=='-'||s[n-2]=='-'||s[n-1]=='-'||s[n]=='-') {
        cout<<"No"<<endl;
        return ;
    }
    int exist_=0;
    rep(i,1,n) exist_|=s[i]=='-';
    if(!exist_) {
        cout<<"No"<<endl;
        return ;
    }

    cout<<"Yes ";

    int consecusive=n;
    while(s[consecusive-1]=='>') consecusive--;
    while(n-consecusive>2) ans.priopush(n-4,n),n--;

    int L=n-3,R=n;
    while(s[L-1]=='-') L--;
    L--;
    ans.push(L,R);

    while(L!=1) {
        if(s[L-1]=='>') {
            ans.push(L-1,L+3);
            L--;
        }
        else {
            int head_=L-1;
            while(s[head_-1]=='-') head_--;
            ans.push(head_-1,L+2);
            L=head_-1;
        }
    }

    ans.flush();

}

signed main () {
    ios::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
    int _ = 1 ;
    cin >> _ ;
    while (_ -- ) {
        solve() ; 
    }

    return 0 ; 
}