#include <bits/stdc++.h>
using ll = long long;

void solve() {
	std::string s;
	std::cin >> s;
	int n = s.size();
	int flag = 0;
	for(int i = 0; i < n; i++) if(s[i] == '-') {
		flag = 1;
	} 
	int p = n, cnt = 0;
	while(p - 1 >= 0 && s[p - 1] == '>') {
		p--;
		cnt++;
	}
	if(cnt < 3 || s[0] != '>' || n < 5) flag = 0;
	if(!flag) {
		std::cout << "No\n";
		return;
	}
	std::vector<int> l, len;
	int i = n - 1;
	while(i > 0) {
		int j = i, cnt = 0;
		while(j - 1 >= 0 && s[j - 1] == '>') j--;
		int m = j;
		
		while(j - 1 >= 0 && s[j - 1] == '-') {
			j--;
			cnt++;
		}
		if(cnt > 0) {
			l.push_back(j - 1);
			len.push_back(cnt + 4);	
		}
		if(i == n - 1) {
			for(int k = m - 2; k + 4 < n; k++) {
				l.push_back(k);
				len.push_back(5);
			}
		}
		else {
			for(int k = i - 1; k >= m; k--) {
				l.push_back(k);
				len.push_back(5);
			}
		}
		i = j - 1;
		
		
		
	}
	std::cout << "Yes " << l.size() << '\n';
	for(int i = l.size() - 1; i >= 0; i--) {
		std::cout << l[i] + 1 << " " << len[i] << '\n';
	}
}

int main()
{
	//std::ios::sync_with_stdio(0);
	//std::cin.tie(0);
	//std::cout.tie(0);
	int t = 1;
	std::cin >> t;
	while(t--) solve();
	return 0;
}