#include <iostream>
#include <fstream>
#include <string>
using namespace std;

void print_route(string &s)
{
  int cur=0;
  while(cur<s.length()){
    int end=s.length();
    if (cur+50<=s.length())
      end=cur+50;
    for (int i=cur;i<end;i++)
      cout<<s[i];
    cout<<endl;
    cur=end;
  }
  cout<<endl;
}

int main()
{
  ifstream cin("kindergarten.in");
  int cases;cin>>cases;
  while(cases--){
    int ix;cin>>ix;
    int g,b;cin>>g>>b;
    int n=g+b+1;
    string ans;
    string bd;
    for (int i=0;i<g;i++) bd+='G';
    bd+=' ';
    for (int i=0;i<b;i++) bd+='B';

    if (g==0){
      for (int i=0;i<b/2;i++) ans+='h';
      if (b%2==1) ans+='s';
      cout<<ix<<" "<<ans.length()<<endl;
      print_route(ans);
      continue;
    }

    if (b==0){
      for (int i=0;i<g/2;i++) ans+='H';
      if (g%2==1) ans+='S';
      cout<<ix<<" "<<ans.length()<<endl;
      print_route(ans);
      continue;
    }
    
    bool phase=false;
    for (;;){
      bool hopped=false;
      if (!phase){
        // B<-
        int s;
        for (s=0;s<bd.length();s++) if (bd[s]==' ') break;
        if (s!=0&&bd[s-1]=='G'){
          swap(bd[s-1],bd[s]);
          s--;
          ans+='S';
        }else{
          assert(s!=n-1&&bd[s+1]=='B');
          swap(bd[s],bd[s+1]);
          s++;
          ans+='s';
        }
        // ToDo: Hop
        while(s<n-2&&bd[s+1]=='G'&&bd[s+2]=='B'){
          swap(bd[s],bd[s+2]);
          hopped=true;
          s+=2;
          ans+='h';
        }
      }
      else{ //G hop tern?
        int s;
        for (s=0;s<bd.length();s++) if (bd[s]==' ') break;
        if (s!=n-1&&bd[s+1]=='B'){
          swap(bd[s+1],bd[s]);
          s++;
          ans+='s';
        }else{
          assert(s!=0&&bd[s-1]=='G');
          swap(bd[s],bd[s-1]);
          s--;
          ans+='S';
        }
        // ToDo: Hop
        while(s>=2&&'B'==bd[s-1]&&'G'==bd[s-2]){
          swap(bd[s-2],bd[s]);
          hopped=true;
          s-=2;
          ans+='H';
        }
      }
      phase=!phase;
      if (!hopped) break;
    }
    //cout<<"***** "<<bd<<endl;
    cout<<ix<<" "<<ans.length()<<endl;
    print_route(ans);
    //cout<<ans<<endl; // todo kaigyo
  }
  return 0;
}