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

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    if (s[0] != '>') {
        cout << "No\n";
        return;
    }
    if (s[n-1] != '>' || s[n-2] != '>' || s[n-3] != '>') {
        cout << "No\n";
        return;
    }
    if (count(s.begin(), s.end(), '-') == 0) {
        cout << "No\n";
        return;
    }

    vector<pair<int, int>> a1, a2;
    int bg = 1e9, ed = -1;
    for (int i = 0; i < n; i++) {
        if (s[i] == '>') {
            if (bg <= ed) {
                a1.emplace_back(bg-1, ed+3);
                bg = 1e9, ed = -1;
            }
        } else {
            bg = min(bg, i), ed = max(ed, i);
        }
    }

    int prev = 0;
    for (auto [l, r]: a1) {
        for (int i = prev; i < l; i++) {
            a2.emplace_back(i, i+4);
        }
        prev = r+1;
    }
    reverse(a2.begin(), a2.end());
    for (int i = prev-4; i < n-4; i++) {
        a2.emplace_back(i, i+4);
    }
    reverse(a2.begin(), a2.end());

    cout << "Yes " << a1.size() + a2.size() << '\n';
    for (auto [l, r]: a2) {
        cout << l+1 << ' ' << r-l+1 << '\n';
    }
    for (auto [l, r]: a1) {
        cout << l+1 << ' ' << r-l+1 << '\n';
    }
}

int main() {
    cin.tie(0)->sync_with_stdio(0);

    int t;
    cin >> t;
    for (; t; t--) solve();

    return 0;
}