#include <bits/stdc++.h>
using namespace std;
#define all(v) (v).begin(),(v).end()
#define pb(a) push_back(a)
#define rep(i, n) for(int i=0;i<n;i++)
#define foa(e, v) for(auto& e : v)
using ll = long long;
const ll MOD7 = 1000000007, MOD998 = 998244353, INF = (1LL << 60);
#define dout(a) cout<<fixed<<setprecision(10)<<a<<endl;

void solve() {
    string s;
    cin >> s;
    int n = s.size();
    if(s[0] != '>' or s.substr(n - 3, 3) != ">>>" or count(all(s), '-') == 0) {
        cout << "No\n";
        return;
    }
    int id = -1;
    rep(i, n) {
        if(s[i] == '-') id = i;
    }
    vector<pair<int, int>> ans;
    int ri = n;
    int le = id;
    {
        
        while(s[le] == '-') le --;
        ans.push_back({le, id - le + 1 + 3});
        ri = le;
        le --;
        for(int i = id; i + 5 <= n; i ++) {
            ans.push_back({i, 5});
        }
    }
    while(le >= 0) {
        id = le;
        for(int i = le; i >= 0; i --) {
            if(s[i] == '>') {
                id = i;
                break;
            }
        }
        // cout << le << " " << ri << endl;
        ans.push_back({id, max(5, ri - id + 3)});
        ri = id;
        le = id - 1;
    }
    reverse(all(ans));
    cout << "Yes " << ans.size() << '\n';
    for(auto [x, y] : ans) {
        cout << x + 1 << " " << y << '\n';
    }
}
int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int t;
    cin >> t;
    rep(i, t) solve();
    return 0;
}