#include <bits/stdc++.h>

using namespace std;

#define deg( x ) cout<<""#x"="<<x<<endl
#define endl '\n'
#define int long long
#define pll pair<int,int>
#define fr first
#define se second

const int N=1e5+10;

string pan( vector<pll> &A , int n ){
    string s;
    for( int i=1; i<=n; i++ ) s+='*';
    for( auto [ l , r ]:A ){
        if( r-l+1 < 5 ) return "*";
        s[ l-1 ]='>';
        for( int i=l; i<r-3; i++ ) s[ i ]='-';
        s[ r-1 ]=s[ r-2 ]=s[ r-3 ]='>';
    }

    return s;
}

void solve(){
    string s;
    cin>>s;

    int n=s.size();

    vector<pll> ans;

    if( n<5 ){
        cout<<"No"<<endl;
        return;
    }
    if( s[ 0 ]=='>' && s[ n-1 ]==s[ n-2 ] && s[ n-2 ]==s[ n-3 ] && s[ n-1 ]=='>' ){
        int o=0;
        for( int i=0; i<n; i++ ){
            if( s[ i ]=='-' ) o++;
        }

        ans.push_back( { n-4 , n } );

        if( o==0 ){
            cout<<"No"<<endl;
            return;
        }
        else{
            int nn=n;
            while( s[ n-4 ]=='>' ){
                n--;
                ans.push_back( { n-4 , n } );
            }

            for( int l=0; l<=n-4; l++ ){
                int r=l+4;
                if( s[ l ]=='-' ) continue;
                if( s[ l+1 ]=='>' ){
                    ans.push_back( { l+1 , r+1 } );
                }
                else{
                    int cnt=-1;
                    int e=l+1;
                    while( s[ e ]=='-' ) cnt++ , e++;
                    r+=cnt;
                    ans.push_back( { l+1 , r+1 } );
                }
            }
            cout<<"Yes "<<ans.size()<<endl;
            for( auto [ l , r ]:ans ){
                cout<<l<<" "<<r-l+1<<endl;
            }

            //cout<<pan( ans , nn )<<endl;
        }
    }
    else{
        cout<<"No"<<endl;
    }

}

signed main() {
    ios::sync_with_stdio( 0 );
    cin.tie( 0 ); cout.tie( 0 );

    int T=1;
    cin>>T;

    while( T-- ){
        solve();
    }

    return 0;
}