#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int N;
char S[100'010];

int main() {
  for (int numCases; ~scanf("%d", &numCases); ) { for (int caseId = 1; caseId <= numCases; ++caseId) {
    scanf("%s", S);
    N = strlen(S);
    
    vector<pair<int, int>> ps;
    for (int i = 0, j = 0; i < N; i = j) {
      for (j = i; j < N && S[i] == S[j]; ++j) {}
      if (S[i] == '-') {
        ps.emplace_back(i, j);
      }
    }
    
    bool ok = true;
    ok = ok && (S[0] == '>');
    for (int i = N - 3; i < N; ++i) ok = ok && (S[i] == '>');
    ok = ok && ps.size();
    
    if (ok) {
      vector<int> used(N, 0);
      for (const auto &p : ps) {
        used[p.first - 1] = 1;
      }
      printf("Yes %d\n", N - 4);
      for (int i = N - 4; --i > ps[0].first - 1; ) if (!used[i]) {
        printf("%d %d\n", i + 1, 5);
      }
      for (int i = 0; i <= ps[0].first - 1; ++i) if (!used[i]) {
        printf("%d %d\n", i + 1, 5);
      }
      for (const auto &p : ps) {
        const int l = p.first - 1;
        const int r = p.second + 3;
        printf("%d %d\n", l + 1, r - l);
      }
    } else {
      puts("No");
    }
  }
#ifndef LOCAL
  break;
#endif
  }
  return 0;
}