#include<bits/stdc++.h>
#define int long long
using namespace std;
typedef pair<int,int> pii;
const int N=1e6+10;
int n,m,a,b,c;
string s;
void solve()
{
	cin>>s;
	n=s.size();
	s=" "+s;
	if(s[n]!='>'||s[n-1]!='>'||s[n-2]!='>')
	{
		cout<<"No"<<endl;return;
	}
	vector<pii>f;
	vector<pii>ans;
	if(s[1]=='-')
	{
		cout<<"No"<<endl;return;
	}
	for(int i=1;i<=n;i++)
	{
		int j=i;
		while(s[j+1]==s[i]&&j+1<=n)j++;
		f.push_back({i,j});
		//cout<<i<<' '<<j<<endl;
		i=j;
	}
	m=f.size();
	if(m==1)
	{
		cout<<"No"<<endl;return;
	}
	for(int i=0;i<f.size()-3;i+=2)
	{
		//cout<<"*"<<endl;
		int R=f[i+1].second;
		for(int j=f[i].first;j<=f[i].second;j++)ans.push_back({j,R+3});
	}
	int l1=f[m-3].first,r1=f[m-3].second;
	int l2=f[m-2].first,r2=f[m-2].second;
	int l3=f[m-1].first,r3=f[m-1].second;
	//cout<<l1<<' '<<r1<<' '<<l2<<' '<<r2<<' '<<l3<<' '<<r3<<endl;
	for(int i=r3;i>=l3+2;i--)ans.push_back({l1,i});
	for(int i=l1+1;i<=r1;i++)ans.push_back({i,l3+2});
	cout<<"Yes"<<' '<<ans.size()<<endl;
	for(auto x:ans)cout<<x.first<<' '<<x.second-x.first+1<<endl;
}
signed main()
{
	int T;cin>>T;
	while(T--)solve();
	return 0;
}