// Ice cream? I scream! 
#include <bits/stdc++.h>
#ifdef ONLINE_JUDGE
	#define freopen Chitanda
#endif
#define wjy namespace
#define xsy std
typedef long long ll;
using wjy xsy;

template<typename T> void debug(string s, T x) {cerr << " " << s << " = " << x << " \n";}
template<typename T, typename... Args> void debug(string s, T x, Args... args) {for (int i = 0, b = 0; i < (int)s.size(); i++) if (s[i] == '(' || s[i] == '{') b++;else if (s[i] == ')' || s[i] == '}') b--;else if (s[i] == ',' && b == 0) {cerr << " " << s.substr(0, i) << " = " << x << " |";debug(s.substr(s.find_first_not_of(' ', i + 1)), args...);break;}}
#ifdef ONLINE_JUDGE
	#define Debug(...)
#else
	#define Debug(...) debug(#__VA_ARGS__, __VA_ARGS__)
#endif

const int MAXN = 1e6 + 5;

char s[MAXN];
vector<pair<int, int> > ans;
queue<int> q;
stack<int> p;

int main()
{
	int T;
	scanf("%d", &T);
	while (T--)
	{
		ans.clear();
		while (!q.empty())
			q.pop();
		while (!p.empty())
			p.pop();
		scanf("%s", s + 1);
		int n = strlen(s + 1);
		bool flg = true;
		for (int i = n; i >= n - 2; i--)
			flg &= (s[i] == '>');
		if (!flg)
		{
			puts("No");
			continue;
		}
		flg = false;
		for (int i = 1; i <= n; i++)
			flg |= (s[i] == '-');
		if (!flg)
		{
			puts("No");
			continue;
		}
		if (s[1] != '>')
		{
			puts("No");
			continue;
		}
		int pos;
		for (pos = 1; pos <= n; pos++)
			if (s[pos] != '>')
				break;
		pos--;
		flg = true;
		for (int i = n; i > pos; i--)
		{
			bool x = (i >= 3) && s[i] == '>' && s[i - 1] == '>' && s[i - 2] == '>' && (i - 2 >= 3);
			bool y = (i <= n - 1) && (i - 1 >= 3) && s[i] == '>' && s[i - 1] == '>' && s[i + 1] == '>';
			bool z = (i <= n - 2) && (i >= 3) && s[i] == '>' && s[i + 1] == '>' && s[i + 2] == '>';
			if (flg && i >= 3 && x)
				q.push(i), i -= 2;
			else if (flg && i >= 2 && y)
				q.push(i + 1), i--;
			else if (flg && i >= 2 && z)
				q.push(i + 2);
			else if (s[i] == '>')
				p.push(i), flg = false;
		}
		for (int i = pos; i >= 1; i--)
			if (s[i] == '>')
				p.push(i);
		while (p.size() > 1)
		{
			ans.push_back({p.top(), q.front()});
			p.pop();
			if (q.size() > 1)
				q.pop();
		}
		while (q.size())
			ans.push_back({p.top(), q.front()}), q.pop();
		printf("Yes %zu\n", ans.size());
		for (auto t : ans)
			printf("%d %d\n", t.first, t.second - t.first + 1);
	}
	return 0;
}