#include <bits/stdc++.h>
using namespace std;
const int N = 100010;
int n;
string s;

void solve() {
	cin >> s;
	n = s.size();
	int cnt = 0;
	for(int i = n - 1; ~i; i--) {
		if(s[i] != '>') break;
		++cnt;
	}
	if(cnt == n || cnt < 3 || s[0] != '>') {
		cout << "No\n"; return ;
	}
	vector<pair<int, int> > op;
	vector<int> pos;
	for(int i = 0; i + 1 < n; i++) {
		if(s[i] == '>' && s[i + 1] == '-') {
			int j = i;
			for(; j > 0 && s[j - 1] == '>'; --j);
			for(int k = j; k <= i; k++) {
				pos.push_back(k);
			}
		}
	}
	reverse(pos.begin(), pos.end());
	for(auto v : pos) {
		op.push_back({v + 1, n - cnt + 3});
		cnt -= 3;
		if(cnt < 3) cnt = 3;
	}
	for(; cnt > 3; cnt -= 3) {
		op.push_back({1, n - cnt + 3});
	}
	op.push_back({1, n});
	reverse(op.begin(), op.end());
	cout << "Yes " << op.size() << "\n";
	for(auto v : op) cout << v.first << " " << v.second - v.first + 1 << "\n";
}
int main() {
	ios::sync_with_stdio(0); cin.tie(nullptr);
	int T; cin >> T;
	for(; T; --T) solve();
	return 0;
}