#include <bits/stdc++.h>
#define ll long long
#define Ma 1000005
#define pb push_back
#define IOS ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);

using namespace std;
ll n;
string s;
ll l[Ma],r[Ma];
ll tot=0;


struct pri{
	ll l,r;
}a[Ma];

void sol()
{
	tot=0;
	cin>>s;
	n=s.size();
	for (ll i=0;i<s.size();i++)
	{
		if (s[i]=='>')
		{
			tot++;
			l[tot]=i+1;
			while (i<s.size()&&s[i+1]=='>')
				i++;
			r[tot]=i+1;
		}
	}
	if (tot==1||l[1]!=1||r[tot]-l[tot]+1<3||r[tot]!=n)
	{
		printf("No\n");
		return;
	}
	printf("Yes ");
	ll cnt=0;
	for (ll i=1;i<tot;i++){
		for (ll j=l[i];j<=r[i];j++)
			a[++cnt]={j,l[i+1]+2-j+1};
	}
	for (ll i=r[tot];i>=l[tot]+2;i--)
		a[++cnt]={r[tot-1],i-r[tot-1]+1};
	printf("%lld\n",cnt);
	for (ll i=1;i<=cnt;i++)
		printf("%lld %lld\n",a[i].l,a[i].r);
}


int main()
{
	IOS
	ll tt=1;
	cin>>tt;
	while (tt--)
		sol();
	return 0;
}