#include<bits/stdc++.h>
#define M 100005
using namespace std;
int T,n;
char c[M];
vector<pair<int,int> >ans;
void  Fail(){printf("No\n");}
void print(){
	printf("Yes %d\n",ans.size());
	for(auto q:ans) printf("%d %d\n",q.first,q.second);
}
void solve(){
	ans.clear();
	scanf(" %s",c+1);n=strlen(c+1);
	if(c[1]=='-'){Fail();return ;}
	int nw=n;
	while(nw>=1) if(c[nw]=='>') nw--;else break;
	if(nw==0){Fail();return ;}
	int nww=nw;
	while(nw>=1) if(c[nw]=='-') nw--;else break;
	if(nww>n-3){Fail();return ;}
	for(int i=nww+3;i<=n;++i) ans.emplace_back(make_pair(nw,i-nw+1));nw--;
	while(nw>=1){
		while(nw>=1) if(c[nw]=='-') nw--;else break;
		ans.emplace_back(make_pair(nw,n-nw+1));nw--;
	}
	reverse(ans.begin(),ans.end());
	print();
}
int main(){
	scanf("%d",&T);
	while(T--) solve();
	return 0;
}