#include<bits/stdc++.h>

#define ll long long
#define pi pair<int,int>
#define vi vector<int>
#define cpy(x,y,s) memcpy(x,y,sizeof(x[0])*(s))
#define mset(x,v,s) memset(x,v,sizeof(x[0])*(s))
#define all(x) begin(x),end(x)
#define fi first
#define se second
#define mp make_pair
#define pb push_back
#define ary array

using namespace std;

#define N 500005

int read(){
    int x=0,f=1;char ch=getchar();
    while(ch<'0' || ch>'9')f=(ch=='-'?-1:f),ch=getchar();
    while(ch>='0' && ch<='9')x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
    return x*f;
}
void write(int x){
    if(x<0)x=-x,putchar('-');
    if(x/10)write(x/10);
    putchar(x%10+'0');
}

char s[N];
vector<pi> res;
void solve(){
    scanf("%s",s+1);int n=strlen(s+1);
    int pos=0;
    vi S;res.clear();
    for(int i=1;i<=n;i++)if(s[i]=='>'){pos=i;break;}
    if(!pos || pos!=1){printf("No\n");return;}
    for(int i=n;i>=1;){
        if(s[i]!='>'){i--;continue;}
        int j=i;
        if(i!=n){printf("No\n");return;}
        while(j-1>=1 && s[j-1]=='>')j--;
        if(i-j+1<=2){printf("No\n");return;}
        if(pos==j){printf("No\n");return;}
        for(int k=i;k>=j+3;k--){
            res.pb(mp(pos,k-pos+1));
        }
        for(int k=1;k<=j-1;k++){
            if(s[k]=='>')res.pb(mp(k,(j+2)-k+1));
        }
        
        break;
    }
    printf("Yes ");write(res.size());putchar('\n');
    for(auto [u,v]:res)write(u),putchar(' '),write(v),putchar('\n');
}

int main(){
    #ifdef EAST_CLOUD
    freopen("a.in","r",stdin);
    //freopen("a.out","w",stdout);
    #endif

    int T=read();while(T--)solve();
}