#include<bits/stdc++.h>
using namespace std;
string s;
const int N=100006;
int n,m,l;
char ss[N];
int a[N];
int b[N];
int c[N];
int ansl[N],ansr[N];
int main()
{
	int T;
	cin>>T;
	while(T--)
	{	
		for(int i=1;i<=m;i++) a[i]=0,b[i]=0,c[i]=0;
		for(int i=1;i<=n;i++) ansl[i]=0,ansr[i]=0; 
		for(int i=1;i<=l;i++) ss[i]=' ';
		n=0;
		l=0;
		m=0;
		cin>>s;
		l=s.length();
		for(int i=1;i<=l;i++)
		{
			ss[i]=s[i-1];
		}
		int ii=1;
		while(ss[ii]=='>') ii++;
		for(ii;ii<=l;)
		{
			if(ss[ii]=='-')
			{
				a[++m]=ii;
				while(ss[ii]=='-') ii++;
				b[m]=ii;
				while(ss[ii]=='>') 
				{
					c[m]++;
					ii++;
				}
			}
			
		}
//		for(int i=1;i<=m;i++)
//		{
//			cout<<a[i]<<" "<<b[i]<<endl;
//		}
//gkd
		if(l-(b[m]-1)<3||m==0||ss[1]=='-')
		{
			cout<<"No\n";
		}
		else
		{
			cout<<"Yes ";
			int j=1;
			while(ss[j+1]=='>')
			{
				ansl[++n]=j;
				ansr[n]=5;
				j++;
			}
			for(int i=1;i<=m;i++)
			{
				if(c[i]>3)
				{
					for(int k=b[i]+c[i]-1;k>=b[i]+2;k--)
					{
						ansl[++n]=a[i]-1;
						ansr[n]=k-(a[i]-1)+1;
					}
				}
				if(c[i]<=3)
				{
					ansl[++n]=a[i]-1;
					ansr[n]=b[i]+2-(a[i]-1)+1;
				}
			}
			cout<<n<<endl;
			for(int i=1;i<=n;i++)
			{
				cout<<ansl[i]<<" "<<ansr[i]<<endl;
			}
		}
	}
	
	return 0;
 } 
 /*
 >>>>>>>>>->>>>>
Yes 12
1 5
2 5
3 5
4 5
5 5
6 5
7 5
8 5
9 8
9 7
9 6
9 5
*/