#pragma GCC optimize(3, "Ofast", "inline")
#define FOR(i, a, b) for(int i = (a); i <= (b); i ++)
#define ROF(i, a, b) for(int i = (a); i >= (b); i --)
#define debug(x) cerr << (#x) << ": " << (x) << '\n'
#define pb push_back
#define IOS ios::sync_with_stdio(0), cin.tie(0), cout.tie(0)
 
#include <bits/stdc++.h>
 
using namespace std;
 
#define int long long
typedef long long ll;
typedef unsigned long long ull;
typedef array<int, 2> pii;
typedef array<ll, 2> pll;
mt19937_64 rnd(chrono::steady_clock::now().time_since_epoch().count());

char s[100010];

void solve(int T) {
	scanf("%s", &s[1]);
	int n = strlen(s + 1);
	if(s[1] != '>' || s[n] != '>' || s[n - 1] != '>' || s[n - 2] != '>') {
		cout << "No\n";
		return;
	}
	int t = 0, tot = 0;
	FOR(i, 1, n) if(s[i] == '-') t = i;
	FOR(i, 1, t - 1) if(s[i] == '-') tot ++;
	if(!t) {
		cout << "No\n";
		return;
	}
	cout << "Yes " << t - 1 - tot + n - t - 2 << '\n';
	ROF(i, n - 4, t - 1) {
		cout << i << " 5\n";
	}
	FOR(i, 1, t - 1) {
		if(s[i] == '-') continue;
		if(s[i + 1] == '>') cout << i << " 5\n";
		else {
			int j = i + 1;
			while(s[j] == '-') j ++;
			j --;
			cout << i << ' ' << j - i + 4 << '\n';
			i = j;
		}
	}
}

void init() {
}

signed main() {
	// IOS;
	int t = 1;
	cin >> t;
	init();
	FOR(T, 1, t) {
		solve(T);
	}
  	return 0;
}