#include<bits/stdc++.h>
using namespace std;
const int maxn = 1e5+5;
#define pb push_back
#define fi first 
#define se second
int vis[maxn];
map<int,int>mp;
string s;
int n;

int work(int sta)
{
  vis[sta-1] = 1;
  int l = 0;
  for(int i = sta; i <= n; ++i)
  {
    if(s[i] == '-')vis[i] = 1, l++;
    else
    {
      break;
    }
  }
  for(int i = sta + l; i <= sta + l + 2; ++i)
  {
    vis[i] = 1;
  }
  return l + 3;
}

void solve()
{
  cin >> s;
  n = s.size();
  s = " " + s;
  if(s[1] == '-')
  {
    cout << "No" << '\n';
    return; 
  }

  int flag = 0;
  for(int i = 1; i <= n; ++i)
  {
    if(s[i] == '-')
    {
      flag = 1; break;
    }
  }
  if(!flag) 
  {
    cout << "No" << '\n';
    return;
  }

  int cnt = 0;
  for(int i = n; i > 0; --i)
  {
    if(s[i] == '>')cnt++;
    else
    {
      break;
    }
  }
  // cout << '\n' << cnt << '\n';
  if(cnt < 3) 
  {
    cout << "No" << '\n';
    return;
  }

  for(int i = 1; i <= n; ++i) vis[i] = 0;

  vector<int> pos;
  for(int i = 1; i <= n; ++i)
  {
    if(s[i] == '-')
    {
      pos.pb(i);
      int len = work(i);
      // cout << "check1() : " << i << ' ' << len << '\n';
      mp[i] = len - 3;
      i += mp[i]-1;
      // cout << "check() : " << i << ' ' << mp[i] << '\n';
    }
  }

  vector<pair<int,int>> ans;
  int cntx = 0;

  for(int i = 1; i <= n; ++i)
  {
    if(!vis[i])
    {
      auto ret = upper_bound(pos.begin(), pos.end(), i) - pos.begin();
      if(ret != pos.size())ans.pb({i, mp[pos[ret]] + 4});
      else 
      {
        cntx++;
      }
    }
  }
  // cout << cntx << '\n';
  int las = n;
  while(cntx && las)
  {
    if(cntx >= 3)
    {
      cntx -= 3;
      ans.pb({las - 4, 5});
      las -= 3;
    }
    else
    {
      cntx = 0;
      ans.pb({las - 4, 5});
      las -= 3;
    }
  }
  for(int i = 1; i <= n; ++i)
  {
    if(s[i] == '-')
    {
      ans.pb({i-1, mp[i] + 4});
      i += mp[i]-1;
    }
  }
  cout << "Yes" << ' ' << ans.size() << '\n';
  for(auto u : ans)
  {
    cout << u.fi << ' ' << u.se << '\n';
  }

}

int main()
{
  ios::sync_with_stdio(0);
  cin.tie(0); cout.tie(0);
  // cout << "begin()" << '\n';
  int t; cin >> t;
  while(t--)solve();
}