UVA_278_Chess

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#define N 1000000
#define LL unsigned long long
using namespace std;

int main() {
    int t,fil,col,prod ;
    char piece;
 scanf("%d",&t);
 while(t--){
    cin>>piece>>fil>>col;
    if(piece=='r'){
        printf("%d\n",fil);
    }else if(piece=='Q'){
        printf("%d\n",fil);
    }else if(piece=='k'){
        prod=fil*col/2;
        if ((fil%2!=0) && (col%2!=0)){

            prod++;
        }

        printf("%d\n",prod);
    }else {
        if (fil%2!=0) fil++;
       if(col%2!=0) col++;
       printf("%d\n",fil*col/4);
    }

 }
    return 0;
}