#include <iostream>
#include <cstring>
#include <queue>
#include <map>
#include <cstdio>
#include <unordered_map>
#include <deque>
#include <iomanip>
#include <cmath>
#include <vector>
#include <algorithm>
#include <stack>
#include <set>
#include <array>
#include <bitset>
#include <limits.h>
#include <numeric>
#define x first
#define y second

using namespace std;
typedef  long long LL;
typedef long long ll  ; 
typedef pair<int,int> PII;
typedef pair<int,LL> PIL;
typedef pair<int ,PII> PIII ;
typedef pair<int, pair<PII ,int > > PIIII;
typedef pair<LL , LL> PLL ; 
typedef pair<LL ,int > PLI ;
typedef pair<int,char > PIC ; 
typedef unsigned long long ULL ;
 
const int N = 5e5+10,M = 4e5+10  ;
const LL mod = 1e9+7 , INF = 1e18+10;
const int inf =  1e8 ; 
const double eps = 1e-7 ;
const ULL  P=  131 ;
// LL n , m  , k   ;



void solve( ) {
	string s ;
	cin >> s ;
	int n = s.size() ; 
	if( s[0] != '>' || s[n-3] == '-' || s[n-2] == '-' || s[n-1] == '-'  ) {
		cout <<"No\n" ;return ;
	}
	bool f = false ;
	for(auto ch : s ) f |= ch == '-' ;
	if( !f ) {
		cout <<"No\n" ;return ;
	}
	vector< array<int,2>> a ;
	for(int i = 0 ; i < n ; ++ i ) {
		int j = i + 1 ;
		while( j < n && s[i] == s[j] ) ++ j ; 
		a.push_back( { i + 1 , j  }) ;
		i = j - 1 ;
	}
	vector< array<int,2>> ans , tmp;
	for(int i = 0 ; i + 1 < a.size() ; i += 2 ) {
		auto [ L , R ] = a[i] ;
		for(int j = L ; j <= R ; ++ j )
			ans.push_back( { j , j + 4 }) ;
		ans.pop_back() ;
		ans.push_back( { R , a[i+1][1] + 3 } ) ;
	}
	auto [ L , R ] = ans.back() ; ans.pop_back() ;
	for(int i = R  ; i - n < 3 ; i += 3  ) {
		tmp.push_back({ L , min( i , n) }) ;
	}
	reverse( tmp.begin()  ,tmp.end()) ;
	for(auto [ l , r ] : tmp ) ans.push_back( { l ,r }) ;
	cout <<"Yes " << ans.size() << '\n';
	for(auto [ l , r ] : ans ) cout << l <<" " << r - l + 1  << '\n'; 
	
	
	
	
	
	
	
	
} 	
 
 
 
int main(){ 	
	ios::sync_with_stdio(false);
	cin.tie( 0 ) ; cout.tie(0) ;
	int T = 1 ;
	cin >> T ;
	while(T-- ){	
		solve() ;  
   	}        
 	return  0 ;
}