#include<bits/stdc++.h>
using namespace std;
#define int long long
#define rep(i,l,r) for(int i=l;i<=r;i++) 
#define dep(i,l,r) for(int i=r;i>=l;i--) 
const int N=1e5+10;
void solve(){
	string s;cin>>s;
	int n=s.size();s=' '+s;
	if(s[1]=='>'&&s[n]=='>'&&s[n-1]=='>'&&s[n-2]=='>'){
		
	}
	else{
		cout<<"No"<<endl;return ;
	}
	bool flag=0;
	vector<int>ve;
	int len=0;
	int o=n;
	dep(i,1,n){
		if(s[i]=='-'){
			o=i;
			break;
		}
		len++;
	}
	rep(i,2,o){
		if(s[i]=='-'){
			flag=1;
		}	
		else{
			ve.push_back(i);
		}
	}	
	int f=len/3+1;
	int g=f+ve.size();
	if(flag){
		cout<<"Yes"<<' '<<g<<endl;
		int tt=n;
		rep(i,1,f-1){
			cout<<1<<' '<<tt<<endl;
			tt-=3;
		}
		cout<<1<<' '<<o+3<<endl;
		for(auto it:ve){
			cout<<it<<' '<<(o+3)-it+1<<endl;
		}
	}
	else{
		cout<<"No"<<endl;
	} 
}
signed main(){
	int _=1;
	cin>>_;
	while(_--)solve(); 
}