#include <bits/stdc++.h>

namespace stdv = std::views;
namespace stdr = std::ranges;

using i64 = long long;

void solve() {
    std::string s;
    std::cin >> s;

    const int n = s.size();

    if (s[0] != '>' || !s.contains('-') || s.substr(n - 3, 3) != ">>>") {
        std::puts("No");
        return;
    }

    std::vector<std::pair<int, int>> ans;
    bool f = true;
    for (int i = 0; i < n; i++) {
        int j = i;
        while (j + 1 < n && s[j + 1] != '-') {
            j++;
        }
        int l = j;
        if (j == n - 1) {
            break;
        }
        while (j + 1 < n && s[j + 1] == '-') {
            j++;
        }
        int k = j + 1;
        while (j + 1 < n && s[j + 1] != '-') {
            j++;
        }
        if (f) {
            while (s[i] == '>') {
                ans.emplace_back(i + 1, std::max(j - i + 1, k + 3 - i));
                i++;
                j -= 3;
            }
            while (j >= k) {
                ans.emplace_back(l + 1, std::max(j - l + 1, k + 3 - l));
                j -= 3;
            }
        } else {
            while (j >= k) {
                ans.emplace_back(l + 1, std::max(j - l + 1, k + 3 - l));
                j -= 3;
            }
        }
        i = k - 1;
        f = false;
    }

    assert(ans.size() <= n);
    printf("Yes %u\n", ans.size());

    for (auto [a, b] : ans) {
        printf("%d %d\n", a, b);
    }
}

auto main() -> int {
    int t;
    scanf("%d", &t);

    while (t--) {
        solve();
    }

    return 0;
}