#include<bits/stdc++.h>
using namespace std;
char a[1010][1010];
bool b[1010][1010];
int n,m;
inline bool ch(int x,int y)
{
	if(x<=0||x>n||y<=0||y>m||a[x][y]=='x') return false;
	return true;
}
int main()
{
	//freopen("explore5.in","r",stdin);
	//freopen("explore.out","w",stdout);
	int t,k,x,y,d,nx,ny,i,j;
	scanf("%d",&t);
	while(t--)
	{
		memset(b,0,sizeof(b));
		scanf("%d%d%d%d%d%d",&n,&m,&k,&x,&y,&d);
		b[x][y]=1;
		for(i=1;i<=n;i++) scanf("%s",a[i]+1);
		while(k--)
		{
			b[x][y]=1;
			nx=x;ny=y;
			if(d==0) ny++;
			if(d==1) nx++;
			if(d==2) ny--;
			if(d==3) nx--;
			if(ch(nx,ny))
			{
				b[nx][ny]=1;
				x=nx;y=ny;
				continue;
			}
			bool bb=1;
			for(i=1;i<4;i++)
			{
				d=(d+1)%4;
				nx=x;ny=y;
				if(d==0) ny++;
				if(d==1) nx++;
				if(d==2) ny--;
				if(d==3) nx--;
				if(ch(nx,ny))
				{
					b[x][y]=1;
					bb=0;
					break;
				}
			}
			if(bb) break;
		}
		long long ans=0;
		for(i=1;i<=n;i++)
			for(j=1;j<=m;j++)
				if(b[i][j])
				ans++;
		printf("%lld\n",ans);
	}
	return 0;
}