#include<bits/stdc++.h>
using namespace std;
const int N=1001;
int T,n,m,k,x0,y2,d0;
char a[N][N];
int v[N][N],f=0,cnt;
bool good(int x,int y)
{
return x>=1 && x<=n && y>=1 && y<=m && a[x][y]'.';
}
int main()
{
freopen("explore5.in","r",stdin);
freopen("explore.out","w",stdout);
cin>>T;
while(T--)
{
cin>>n>>m>>k;
cin>>x0>>y2>>d0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
cin>>a[i][j];
v[i][j]=0;
}
}
int x=x0,y=y2,d=d0,nx,ny;cnt=1;
v[x0][y2]=1;
while(k>0)
{
if(d0)
{
nx=x;
ny=y+1;
}
else if(d1)
{
nx=x+1;
ny=y;
}
else if(d2)
{
nx=x;
ny=y-1;
}
else
{
nx=x-1;
ny=y;
}
if(good(nx,ny))
{
if(!v[nx][ny])cnt+=1;
v[nx][ny]=1;
x=nx;y=ny;
k--;
}
else
{
d=(d+1)%4;
k--;
}
}
