#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int N=1e6+10,mod=998244353;
typedef pair<int,int>PII;
typedef pair<double,double>PDD;
int n,m,k,w;
int a[N];
string s;
void solve() {
    cin>>s;
    int len=s.length();
    s=" "+s;
    int flen=0;
    bool f=true;
    int lpos=0;
    int ppos=0;
    for(int i=len;i>=1;i--) {
        if(s[i]=='>'&&f)flen++,lpos=i;
        if(s[i]=='-'&&flen)f=false;
    }
    f=true;
    for(int i=1;i<=len;i++) {
        if(s[i]=='>') {
            ppos=i;
            break;
        }
    }
    if(ppos>=lpos) {
        cout<<"No"<<endl;
        return;
    }
    if(flen<3) {
        cout<<"No"<<endl;
        return;
    }
    if(s[1]!='>') {
        cout<<"No"<<endl;
        return;
    }
    if(s[len]!='>') {
        cout<<"No"<<endl;
        return;
    }
    vector<PII>v;
    for(int i=len-2;i>=lpos;i--) {
        if(s.substr(i,3)==">>>")v.push_back({ppos,i-ppos+3});
    }
    for(int i=1;i<lpos;i++) {
        if(s[i]=='>'&&i!=ppos) {
            v.push_back({i,lpos-i+3});
        }
    }
    cout<<"Yes"<<" "<<v.size()<<endl;
    for(auto i:v) {
        cout<<i.first<<" "<<i.second<<endl;
    }
}
signed main() {
    ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
    int T=1;
    cin>>T;
    while(T--) {
        solve();
    }
    return 0;
}