#include <iostream>
#include<stdio.h>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <sstream>
///
using namespace std;
char map[105][105];
int judge[105][105];
int N;
int point[8][2] = {-1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1};
int dfs(int x,int y,int row,int column)
{
if(x<0 || x>=row || y<0 || y>=column || map[x][y]!='W' || judge[x][y] )
return 0;
int sum = 1;
judge[x][y] = 1;
for(int i=0;i<8;i++)
sum+=dfs(x+point[i][0],y+point[i][1],row,column);
return sum;
}
int main()
{
int i,j;
bool flag =false;
char ch;
int temp;
scanf("%d",&N);
getchar();
getchar();
//输入分区数量
while (N--)
{
int row=0,column=0;
char str[105];
int index=0;
if(flag)
cout<<endl;
flag= true;
while (gets(str) && strlen(str)>0)
{
if(str[0]=='W'|| str[0]=='L')
{
strcpy(map[index++],str);
column = strlen(str);
}
else
{
sscanf(str,"%d %d",&i,&j);
memset(judge,0,sizeof(judge));
temp = dfs(i-1,j-1,index,column);
printf("%d\n",temp);
}
}
}
return 0;
}
#include<stdio.h>
#include <string.h>
#include <algorithm>
#include <cmath>
#include <queue>
#include <vector>
#include <sstream>
///
using namespace std;
char map[105][105];
int judge[105][105];
int N;
int point[8][2] = {-1,-1,-1,0,-1,1,0,-1,0,1,1,-1,1,0,1,1};
int dfs(int x,int y,int row,int column)
{
if(x<0 || x>=row || y<0 || y>=column || map[x][y]!='W' || judge[x][y] )
return 0;
int sum = 1;
judge[x][y] = 1;
for(int i=0;i<8;i++)
sum+=dfs(x+point[i][0],y+point[i][1],row,column);
return sum;
}
int main()
{
int i,j;
bool flag =false;
char ch;
int temp;
scanf("%d",&N);
getchar();
getchar();
//输入分区数量
while (N--)
{
int row=0,column=0;
char str[105];
int index=0;
if(flag)
cout<<endl;
flag= true;
while (gets(str) && strlen(str)>0)
{
if(str[0]=='W'|| str[0]=='L')
{
strcpy(map[index++],str);
column = strlen(str);
}
else
{
sscanf(str,"%d %d",&i,&j);
memset(judge,0,sizeof(judge));
temp = dfs(i-1,j-1,index,column);
printf("%d\n",temp);
}
}
}
return 0;
}