// dzx
#include<bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N=1e5+10;
const int M=N-10,P=998244353,INF=1e18+10;
typedef pair<int,int> PII;
#define fi first
#define se second
string s;
vector<PII> v;
int n;
void solve(){
    cin>>s;
    v.clear();
    n=s.size();
    int fg=0,cnt=0;
    for(int i=n-1;i>=0;i--){
        if(s[i]=='-')fg=1;
        if(s[i]=='>'&&!fg)cnt++;
    }
    if(!fg||s[0]=='-'||s[n-1]=='-'||s[n-2]=='-'||s[n-3]=='-'){
        cout<<"No"<<endl;
        return;
    }
    int m=n-1,mm=cnt;
    // cout<<cnt<<endl;
    // return;
    while(cnt>=3){
        v.push_back({0,m});
        cnt-=3;
        m-=3;
    }
    if(cnt){
        v.push_back({0,m+3-cnt});
    }
    for(int i=1;i<n-mm;i++){
        if(i>(n-5))break;
        if(s[i]=='>'&&i<=n-5){
            if(s[i+1]=='>'){
                v.push_back({i,i+4});
            }else{
                int t=i;
                while(s[i+1]=='-'&&i+1<n)i++;
                v.push_back({t,i+3});
            }
        }
    }
    cout<<"Yes "<<v.size()<<endl;
    for(auto [a,b]:v){
        cout<<a+1<<" "<<(b-a+1)<<endl;
    }
}
signed main(){ 
    ios::sync_with_stdio(0);
	cin.tie(0),cout.tie(0);
    int _T=1;
	cin>>_T;
    while(_T--)solve(); 

	return 0;
}