#include<bits/stdc++.h>
using namespace std;

int n,tot;
char a[110000];
pair<int,int> ans[110000];

int read()
{
    int res = 0;
    int x = 1;
    char ch = getchar();
    while(ch > '9' || ch < '0')
    {
        if(ch == '-')
        {
            x = -1;
        }
        ch = getchar();
    }
    while(ch >= '0' && ch <= '9')
    {
        res = res * 10 + ch - '0';
        ch = getchar();
    }
    return res * x;
}

void solve()
{
    scanf("%s",a); n=strlen(a),tot=0;
    int s=0,bk=0;
    for(int i=n-1;i>=0;i--) {
        if(a[i]=='>') ++s;
        else break;
    }
    for(int i=0;i<n;i++)
        if(a[i]=='-') bk=1;
    if(s<3||!bk||a[0]=='-') { printf("No\n"); return; }
    int ed=n;
    while(s>3) {
        ans[++tot]={ed-4,5};
        --s,--ed;
    }
    for(int i=0;i<n;i++) {
        if(a[i+1]=='>') {
            ans[++tot]={i+1,5};
            continue;
        }
        int now=i,len=4;
        while(a[i+1]=='-') ++i,++len;
        ans[++tot]={now+1,len};
        if(now+len>=ed) break;
    }
    printf("Yes %d\n",tot);
    for(int i=1;i<=tot;i++) {
        printf("%d %d\n",ans[i].first,ans[i].second);
    }
}

int main()
{
    //freopen("in1.txt" , "r" , stdin);
    //freopen("out1.txt" , "w" , stdout); 
    int t=1;
    cin>>t;
    while(t--) {
        solve();
    }
    return 0;
}