#include <bits/stdc++.h>
using namespace std; 
#define rep(i, l, r) for (int i = l; i <= r; ++i)
#define dep(i, l, r) for (int i = r; i >= l; --i)
const int N = 1e5 + 5; 
int n, T; char s[N]; 
vector <pair <int, int>> ans;  


int main () {
  cin >> T; 
  while (T--) {
    scanf("%s", s + 1), n = strlen(s + 1); 
    if (s[n] == '-' || s[n - 1] == '-' || s[n - 2] == '-' || s[1] == '-') {
      cout << "No" << '\n'; 
      continue ; 
    }
    int lst = n + 1; 
    dep(i, 1, n) if (s[i] == '-') {
      lst = i; break ; 
    }
    if (lst == n + 1) {
      cout << "No" << '\n'; 
      continue ; 
    }
    for ( ; lst >= 1 && s[lst] == '-'; --lst) ; 
    cout << "Yes "; 
    ans.clear(); 
    for (int i = 1; i < lst; ) {
      if (s[i + 1] == '>') {
        ans.push_back(make_pair(i, 5)); 
        ++i; continue ; 
      } 
      int j = i + 1; 
      for ( ; j <= n && s[j] == '-'; ++j) ;
      ans.push_back(make_pair(i, j - i + 4)); 
      i = j; 
    }
    int cnt = 0; 
    for ( ; s[lst + cnt + 1] == '-'; ++cnt) ;
    dep(i, lst + cnt - 1, n - 4) ans.push_back(make_pair(i, 5)); 
    ans.push_back(make_pair(lst, cnt + 4)); 
    cout << ans.size() << '\n'; 
    for (auto i : ans) cout << i.first << ' ' << i.second << '\n'; 
  }
  return 0; 
}