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

#define ll long long
#define elif else if
#define vi vector<int>
#define vll vector<ll>
#define vvi vector<vi>
#define pii pair<int,int>


#define repname(a, b, c, d, e, ...) e
#define rep(...)                    repname(__VA_ARGS__, rep3, rep2, rep1, rep0)(__VA_ARGS__)
#define rep0(x)                     for (int rep_counter = 0; rep_counter < (x); ++rep_counter)
#define rep1(i, x)                  for (int i = 0; i < (x); ++i)
#define rep2(i, l, r)               for (int i = (l); i < (r); ++i)
#define rep3(i, l, r, c)            for (int i = (l); i < (r); i += (c))





struct ScalarInput {
    template<class T>
    operator T(){
        T ret;
        cin >> ret;
        return ret;
    }
};
struct VectorInput {
    size_t n;
    VectorInput(size_t n): n(n) {}
    template<class T>
    operator vector<T>(){
        vector<T> ret(n);
        for(T &x : ret) cin >> x;
        return ret;
    }
};
ScalarInput input(){ return ScalarInput(); }
VectorInput input(size_t n){ return VectorInput(n); }

template<typename T>
void print(vector<T> a){
  for(int i=0;i<a.size();i++){
    cout<<a[i]<<" \n"[i+1==a.size()];
  }
}

template<class T>
void print(T x){
    cout << x << '\n';
}
 
template <class Head, class... Tail>
void print(Head&& head, Tail&&... tail){
  cout << head << ' ';
  print(forward<Tail>(tail)...);
}

int dbg=0;
void solve(string s){
  int n=s.size();
  if(s.substr(n-3,3)!=">>>"){
    print("No");
    return;
  }
  if(s[0]!='>'){
    print("No");
    return;
  }
  int pos=-1;
  rep(i,n){
    if(s[i]=='-')pos=i;
  }
  if(pos==-1){
    print("No");
    return;
  }

  // need
  
  vector<pair<int,int>>op;
  int l=0;
  while(l<pos){
    assert(s[l]=='>');
    int r=l+1;
    while(r<n&&s[r]=='-')r++;
    op.push_back({l,max(5,r-l+3)});
    l=r;
  }
  int last=pos;
  while(s[last]=='-')last--;
  for(int i=n-5;i>=pos;i--){
    op.push_back({i,5});
  }
  op.push_back({last,pos-last+4});
  if(dbg){
    string t(n,'*');
    for(auto [left,len]:op){
      cerr<<left<<" "<<len<<endl;
      assert(left+len<=n);
      assert(len>=5);
      t[left]='>';
      rep(i,1,len-3)t[left+i]='-';
      rep(i,len-3,len)t[left+i]='>';
    }
    assert(t==s);
    print(s,t);
  }
  print("Yes",op.size());
  for(auto [left,len]:op){
    print(left+1,len);
  }
}

int main(){
  ios::sync_with_stdio(false);
  cin.tie(nullptr);

  if(dbg){
    for(int n=5;n<10;n++){
      rep(bit,1<<n){
        string s;
        rep(i,n){
          if((bit>>i)&1){
            s+='>';
          }
          else{
            s+='-';
          }
        }
        solve(s);
      }
    }
  }
  int T;
  cin>>T;
  rep(T){
    string s;
    cin>>s;
    solve(s);
  }
}