#include <bits/stdc++.h>

using namespace std;

void solve() {
  string s;
  cin >> s;
  if (s[0] != '>') {
    cout << "No\n";
    return;
  }
  for (int i = s.size()-3; i < s.size(); i++) {
    if (s[i] != '>') {
      cout << "No\n";
      return;
    }
  }

  bool has_stick = false;
  for (char c : s) {
    if (c == '-') {
      has_stick = true;
      break;
    }
  }

  if (!has_stick) {
    cout << "No\n";
    return;
  }
  

  vector<int> starts, lengths;
  stack<int> start_e, length_e;
  int head_idx = s.size();

  int arrow_heads = 0;

  bool consecutive_heads = true;

  int i = 1;
  int tail_idx = 0;

  while (s[i-1] == '>') {
    starts.push_back(i);
    lengths.push_back(s.size()-i+1);
    i++;
  }
  tail_idx = i-1;

  // i is 1-indexed
  for (i = s.size()-3; i > tail_idx; i--) {
    
    // If it is arrow head
    if (s[i-1] == '>') {
      arrow_heads++;
      // Make a new arrow from 1 to this arrow head.
      if (arrow_heads == 3) {

        while (start_e.size()) {
          starts.push_back(start_e.top());
          lengths.push_back(length_e.top());
          start_e.pop();
          length_e.pop();
        }

        starts.push_back(tail_idx);
        lengths.push_back(i+3 - tail_idx);
        head_idx = i+2;

        consecutive_heads = true;
        arrow_heads = 0;
      }

    } 
    // If it is a stick, we determine whether to make an end or a start
    else {
      if (consecutive_heads && arrow_heads) {
        starts.push_back(tail_idx);
        lengths.push_back(i+4 - tail_idx);
        head_idx = i+3;
      } else {
        for (int x = arrow_heads; x >= 1; x--) {
          start_e.push(i+x);
          length_e.push(head_idx - i - x + 1);
        }
      }

      arrow_heads = 0;
      consecutive_heads = false;
    }
  }

  // cout << "Remaining arrow heads: " << arrow_heads << '\n';

  for (int x = arrow_heads; x >= 1; x--) {
    start_e.push(1+x);
    length_e.push(head_idx - x);
  }

  while (start_e.size()) {
    starts.push_back(start_e.top());
    lengths.push_back(length_e.top());
    start_e.pop();
    length_e.pop();
  }


  cout << "Yes " << starts.size() << '\n';
  for (int i = 0; i < starts.size(); i++) {
    cout << starts[i] << ' ' << lengths[i] << '\n';
  }
}


int main() {
  int n; cin >> n;
  while (n--)
    solve();

}