#include<bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;

const int mod=998244353;
inline int add(int x,int y){int ret=x+y;if(ret>=mod)ret-=mod;return ret;}
inline int sub(int x,int y){int ret=x-y;if(ret<0)ret+=mod;return ret;}
inline int mul(int x,int y){return ((ll)x*y)%mod;}
inline int step(int base,int pw){int ret=1;while(pw){if(pw&1)ret=mul(ret,base);base=mul(base,base);pw>>=1;}return ret;}
inline int invv(int x){return step(x,mod-2);}

const int maxn=1e5+10;

bool check(string& s){

    if(s[0]!='>')return false;
    int cnt=0;
    int n=s.size();
    for(int i=n-1;i>=0;i--){
        if(s[i]=='-')break;
        cnt++;
    }
    if(cnt<3)return false;
    if(cnt==n)return false;
    return true;
}

int main(){

    ///freopen("test.txt","r",stdin);

    int t;
    scanf("%d",&t);
    while(t--){

        string s;
        cin>>s;
        if(!check(s)){
            printf("No\n");
            continue;
        }
        printf("Yes ");

        int cnt=0;
        int n=s.size();
        int fin=n;
        for(int i=n-1;i>=0;i--){
            if(s[i]=='-')break;
            cnt++;
        }
        fin-=cnt;

        vector<pii>rez;
        int n2=n;
        while(cnt>3){
            rez.pb({n2-5,n2-1});
            n2-=3;
            cnt-=3;
        }

        int prv=0;
        for(int i=0;i<fin;i++){
            if(s[i]=='-'){
                rez.pb({prv,i+3});
            }
            else{
                prv=i;
                rez.pb({i,i+5-1});
            }
        }

        printf("%d\n",rez.size());
        for(int i=0;i<rez.size();i++){
            printf("%d %d\n",rez[i].ff+1,rez[i].ss-rez[i].ff+1);
        }

    }

    return 0;
}