50分 求条 必关！！！

#include<bits/stdc++.h>
using namespace std;

const int N = 1005;
int t;
int n,m,k,sx,sy,sd;
int ans;
char ma[N][N];
bool vis[N][N];

void solve()
{
	if(sd==0)
	{
		if(ma[sx][sy+1]=='.'&&sx<=n&&sy+1<=m&&sx>=1&&sy+1>=1)
		{
			sy+=1;
			if(vis[sx][sy+1]==0) 
			{
				ans++;
				vis[sx][sy+1]=1;
			}
		}
		else 
		{
			sd=(sd+1)%4;
		}
	}
	else if(sd==1)
	{
		if(ma[sx+1][sy]=='.'&&sx+1<=n&&sy<=m&&sx>=1&&sy>=1)
		{
			sx+=1;
			if(vis[sx+1][sy]==0) 
			{
				ans++;
				vis[sx+1][sy]=1;
			}
		}
		else 
		{
			sd=(sd+1)%4;
		}
	}
	else if(sd==2)
	{
		if(ma[sx][sy-1]=='.'&&sx<=n&&sy-1>=1&&sx>=1&&sy-1<=m)
		{
			sy-=1;
			if(vis[sx][sy-1]==0) 
			{
				ans++;
				vis[sx][sy-1]=1;
			}
		}
		else 
		{
			sd=(sd+1)%4;
		}
	}
	else if(sd==3)
	{
		if(ma[sx-1][sy]=='.'&&sx-1>=1&&sy<=m&&sx-1<=n&&sy>=1)
		{
			sx-=1;
			if(vis[sx-1][sy]==0) 
			{
				ans++;
				vis[sx-1][sy]=1;
			}
		}
		else 
		{
			sd=(sd+1)%4;
		}
	}
}

int main()
{
	cin>>t;
	while(t--)
	{
		memset(vis,0,sizeof vis);
		ans=1;
		cin>>n>>m>>k;
		cin>>sx>>sy>>sd;
		for(int i=1;i<=n;i++)
		{
			for(int j=1;j<=m;j++)
			{
				cin>>ma[i][j];
			}
		}
		vis[sx][sy]=1;
		while(k--)
		{
			solve();
		}
		cout<<ans<<endl;
	}
	return 0;
}