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

void solve(){
    string s;cin>>s;
    int n=s.size();
    s=" "+s;
    if(s[1]!='>'||s[n]!='>'||s[n-1]!='>'||s[n-2]!='>'){
        cout<<"No\n";
        return;
    }
    bool f=false;
    int l=1,r=1;
    vector<pair<int,int>> ans,ans1;

    while(n-2>0&&s[n]=='>'&&s[n-1]=='>'&&s[n-2]=='>'){
        ans1.push_back({n-4,5});
        n--;
    }
    n++;

    while (l+4<=n){
        if(s[l+1]=='>'){
            ans.push_back({l,5});
            l++;
            continue;
        }
        r=l+1;
        while(r<=n&&s[r]=='-')r++;
        f=true;
        ans.push_back({l,r-l+3});
        l=r;
    }
    if(!f){
        cout<<"No\n";
        return;
    }

    cout<<"Yes "<<ans.size()+ans1.size()<<"\n";
    for(auto i:ans1)cout<<i.first<<" "<<i.second<<"\n";
    for(int i=0;i<ans.size();i++){
        cout<<ans[i].first<<" "<<ans[i].second<<"\n";
    }
    
}

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);cout.tie(0);
    int n=1;
    cin>>n;
    while(n--)solve();
    return 0;
}