#include <bits/stdc++.h>

using namespace std;

using i32 = int32_t;
using i64 = long long;

using vi = vector<int>;
using pii = pair<int,int>;


string check(int n, vector<pii> op) {
	string s(n + 1, '*');
	for(auto [x, len] : op) {
		s[x] = s[x + len - 1] = s[x + len - 2] = s[x + len - 3] = '>';
		for(int i = x + 1; i <= x + len - 4; i ++)
			s[i] = '-';
		cout << s << "\n";
	}
	return s;
}

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

	int n = s.size() - 1;

	if(s[0] != '>' or s[n] != '>' or s[n - 1] != '>' or s[n - 2] != '>'){
		cout << "No\n";
		return;
	}
	bool ok = false;
	for(int i = 1; i <= n - 3; i ++) {
		if(s[i] == '-') {
			ok = true;
			break;
		}
	}

	if(ok == false){
		cout << "No\n";
		return;
	}

	vector<pii> op;
	int lst = -1;
	for(int i = n; i >= 0; i --){
		if(s[i] == '>' and s[i - 1] == '>' and s[i - 2] == '>') {
			op.emplace_back(i - 4, 5);
			i = i - 2;
		} else if(s[i] == '>' and s[i - 1] == '>') {
			op.emplace_back(i - 3, 5);
			lst = i - 2;
			break;
		} else if(s[i] == '>') {
			op.emplace_back(i - 2, 5);
			lst = i - 1;
			break;
		} else {
			lst = i;
			break;
		}
	}


	for(int i = 0; i <= lst; i ++){
		if(s[i] == '>') {
			if(s[i + 1] == '-'){
				int len = 4, j = i;
				while(s[i + 1] == '-')
					i ++, len ++;
				op.emplace_back(j, len);
			} else {
				op.emplace_back(i, 5);
			}
		} else {
			assert(false);
		}
	}

	cout << "Yes " << op.size() << "\n";
	for(auto [x, y]: op) cout << x + 1 << " " << y << "\n"; 
	// check(n, op);
	return;
}

int main() {
	ios::sync_with_stdio(false), cin.tie(nullptr);
	int T;
	cin >> T;
	while(T --)
		solve();
	return 0;
}