#include <iostream>

 #include <cstdio>

 #include <cstring>

 #include <algorithm>

 #include <queue>

 #include <map>

 #include <cmath>

 #include <iomanip>

 using namespace std;

 typedef long long LL;

 #define inf (1LL << 25)

 #define rep(i,j,k) for(int i = (j); i <= (k); i++)

 #define rep__(i,j,k) for(int i = (j); i < (k); i++)

 #define per(i,j,k) for(int i = (j); i >= (k); i--)

 #define per__(i,j,k) for(int i = (j); i > (k); i--)

 const int N = ;

 int vis[N][N][];

 int steps;

 struct People{

     char c; //门派

     int tot;//标记

     int x,y;//坐标

     int dir;//方向 正负1来方便判断

     int nx,wx,sx;

     int att(){//攻击

         if(c == 'S') return (0.5 * nx + 0.5 * wx) * (sx * 1.0 + ) /;

         else if(c == 'W') return (0.8 * nx + 0.2 * wx) * (sx * 1.0 + ) /;

         else if(c == 'E') return (0.2 * nx + 0.8 * wx) * (sx * 1.0 + ) /;

     }

     //被攻击

     void is_att(int x) { sx -= x;}

     //移动

     void mv(){

         if(c == 'S'){

             if(!(x + dir >=  && x + dir <= )) dir = -dir;

             x += dir;

         }

         else if(c == 'W'){

             if(!(y + dir >=  && y + dir <= )) dir = -dir;

             y += dir;

         }

         else if(c == 'E'){

             int xx = x + dir;

             int yy = y + dir;

             if(!(xx >=  && xx <=  && yy >=  && yy <= )) dir = -dir;

             if(x + dir >=  && x + dir <=  && y + dir >=  && y + dir <= ) x += dir, y += dir;

         }

     }

     //写下标记

     void vis_w(){

         if(c == 'S'){

             if(vis[x][y][] == ) vis[x][y][] = tot;

             else vis[x][y][] = ;

         }

         else if(c == 'W'){

             if(vis[x][y][] == ) vis[x][y][] = tot;

             else vis[x][y][] = ;

         }

         else if(c == 'E'){

             if(vis[x][y][] == ) vis[x][y][] = tot;

             else vis[x][y][] = ;

         }

     }

     //擦除标记

     void vis_e(){

        rep(i,,) vis[x][y][i] = ;

     }

 }p[];

 bool died[]; //该编号的人是否死亡

 int pl;//人数

 void work(){

     rep(q,,steps){

         rep(i,,) rep(j,,){

             if(vis[i][j][] == ) continue; //一个门派超过两个人

             int a = ,b = ,num = ;

             rep(p,,) if(vis[i][j][p] != ){

                 num++;

                 if(!a) a = vis[i][j][p];

                 else b = vis[i][j][p];

             }

             if(num != ) continue; //不是两个人

             int w1 = p[a].att();

             int w2 = p[b].att();

             p[a].is_att(w2);

             p[b].is_att(w1);

         }

         rep(o,,pl) if(!died[o]){

             p[o].vis_e();//擦除标记

             if(p[o].sx <= ) died[o] = true;

         }

         rep(o,,pl) if(!died[o]){

             p[o].mv();

             p[o].vis_w();//标记

         }

     }

 }

 void print(){

     int m[] = {};

     int t[] = {};

     rep(o,,pl){

         if(died[o]) continue;

         if(p[o].c == 'S') m[]++, t[] += p[o].sx;

         else if(p[o].c == 'W') m[]++, t[] += p[o].sx;

         else if(p[o].c == 'E') m[]++, t[] += p[o].sx;

     }

     cout << m[] << ' ' << t[] << endl;

     cout << m[] << ' ' << t[] << endl;

     cout << m[] << ' ' << t[] << endl;

     cout << "***" << endl;

 } 

 int main(){

     ios::sync_with_stdio(false);

     cin.tie();

     int T;

     cin >> T;

     char in;

     while(T--){

         pl = ;

         rep(i,,) died[i] = false;

         rep(i,,) rep(j,,) rep(k,,) vis[i][j][k] = ;

         cin >> steps;

         while(cin >> in){

             if(in == ''){

                 break;

             }

             ++pl;

             p[pl].c = in;

             p[pl].tot = pl;

             p[pl].dir = ;

             cin >> p[pl].x >> p[pl].y >> p[pl].nx >> p[pl].wx >> p[pl].sx;

             p[pl].vis_w();

         }

         work();

         print();

     }

     getchar(); getchar();

     return ;

 }