#include <bits/stdc++.h>
#define int long long
using namespace std;
int read() {
    int x = 0, f = 1;
    char c = getchar();
    while (c < '0' || c > '9')
        f = (c == '-') ? -1 : 1, c = getchar();
    while (c >= '0' && c <= '9')
        x = x * 10 + c - 48, c = getchar();
    return f * x;
}
struct ans {
    int l, r, ll, rr;
} ans[500010];
int tot = 0;
int check(int a, int b) {
    int l1 = ans[a].l, l2 = ans[b].l, r1 = ans[a].r, r2 = ans[b].r;
    if (r1 + 3 >= l2 || r1 + 3 < l2)
        return 1;
    else
        return 0;
}
int fa[500010], son[500010];
vector<pair<int, int>> asw;
void dfs(int st) {
    if (st == 0)
        return;
    if (ans[st].rr)
        for (int i = ans[st].rr; i > ans[st].r + 3; i--) {
            asw.push_back({ans[st].l - 1, i});
        }
    for (int i = ans[st].ll; i < ans[st].l; i++) {
        asw.push_back({i, ans[st].r + 3});
    }
    dfs(son[st]);
}
signed main() {
    int T = read();
    while (T--) {
        string s;
        cin >> s;
        tot = 0;
        asw.clear();
        int n = s.size();
        s = ' ' + s;
        for (int i = 1; i <= n; i++)
            fa[i] = 0, son[i] = 0, ans[i] = {0, 0, 0, 0};
        if (s[1] != '>' || s[n] != '>') {
            cout << "No\n";
            continue;
        }
        int l = 0, r = 0, lstr = 0;
        for (int i = 1; i <= n; i++) {
            if (s[i] == '-') {
                if (l)
                    r++;
                else
                    l = i, r = i;
            } else {
                if (l) {
                    ans[++tot] = {l, r};
                    ans[tot].ll = lstr + 1;
                    lstr = r;
                }
                l = 0;
            }
            // cerr << i << ' ' << l << ' ' << r << endl;
        }
        ans[tot].rr = n;
        if (tot == 0 || ans[tot].r + 3 > n) {
            cout << "No\n";
            continue;
        }
        for (int i = 1; i < tot; i++) {
            int k = check(i, i + 1);
            if (k == 1)
                fa[i + 1] = i, son[i] = i + 1;
            else
                fa[i] = i + 1, son[i + 1] = i;
        }
        int st = 0;
        for (int i = 1; i <= tot; i++) {
            if (!fa[i]) {
                st = i;
                break;
            }
        }
        dfs(st);
        cout << "Yes" << ' ' << asw.size() << '\n';
        for (auto [x, y] : asw) {
            cout << x << ' ' << y - x + 1 << '\n';
        }
    }
}