#include <bits/stdc++.h>
#define pb emplace_back
#define fst first
#define scd second
#define mkp make_pair
#define uint unsigned
#define mems(a, x) memset((a), (x), sizeof(a))

using namespace std;
typedef long long ll;
typedef double db;
typedef unsigned long long ull;
typedef long double ldb;
typedef pair<int, int> pii;

const int maxn = 100100;

int n;
char s[maxn];

namespace BIT {
	int c[maxn];
	
	inline void init() {
		for (int i = 0; i <= n; ++i) {
			c[i] = 0;
		}
	}
	
	inline void update(int x, int d) {
		for (int i = x; i <= n; i += (i & (-i))) {
			c[i] += d;
		}
	}
	
	inline void update(int l, int r, int x) {
		update(l, x);
		update(r + 1, -x);
	}
	
	inline int query(int x) {
		int res = 0;
		for (int i = x; i; i -= (i & (-i))) {
			res += c[i];
		}
		return res;
	}
}

inline bool check(int l, int r) {
	if (l - 1 < 1 || r + 3 > n) {
		return 0;
	}
	if (!BIT::query(l - 1) && s[l - 1] == '-') {
		return 0;
	}
	for (int i = 1; i <= 3; ++i) {
		if (!BIT::query(r + i) && s[r + i] == '-') {
			return 0;
		}
	}
	return 1;
}

void solve() {
	scanf("%s", s + 1);
	n = strlen(s + 1);
	if (s[1] == '-' || s[n - 2] == '-' || s[n - 1] == '-' || s[n] == '-') {
		puts("No");
		return;
	}
	BIT::init();
	vector<pii> vc;
	set<pii> vis;
	queue<pii> q;
	vector<pii> ans;
	for (int i = 1, j = 1; i <= n; i = (++j)) {
		if (s[i] == '>') {
			continue;
		}
		while (j < n && s[j + 1] == '-') {
			++j;
		}
		vc.pb(i, j);
		if (check(i, j)) {
			vis.emplace(i, j);
			q.emplace(i, j);
		}
	}
	if (vc.empty()) {
		puts("No");
		return;
	}
	while (q.size()) {
		pii p = q.front();
		q.pop();
		ans.pb(p.fst - 1, p.scd - p.fst + 5);
		BIT::update(p.fst - 1, p.scd + 3, 1);
		int x = lower_bound(vc.begin(), vc.end(), p) - vc.begin();
		if (x + 1 < (int)vc.size()) {
			pii u = vc[x + 1];
			if (check(u.fst, u.scd) && vis.find(u) == vis.end()) {
				vis.insert(u);
				q.push(u);
			}
		}
		if (x) {
			pii u = vc[x - 1];
			if (check(u.fst, u.scd) && vis.find(u) == vis.end()) {
				vis.insert(u);
				q.push(u);
			}
		}
	}
	if ((int)vis.size() < (int)vc.size()) {
		puts("No");
		return;
	}
	for (pii p : vc) {
		for (int i = p.scd + 4; i <= n; ++i) {
			if (BIT::query(i)) {
				break;
			}
			ans.pb(i - 4, 5);
		}
	}
	for (int i = vc[0].fst - 1; i; --i) {
		if (!BIT::query(i)) {
			ans.pb(i, 5);
		}
	}
	reverse(ans.begin(), ans.end());
	printf("Yes %d\n", (int)ans.size());
	for (pii p : ans) {
		printf("%d %d\n", p.fst, p.scd);
	}
}

int main() {
	int T = 1;
	scanf("%d", &T);
	while (T--) {
		solve();
	}
	return 0;
}