50!!!

#include <bits/stdc++.h>
using namespace std;
int d,n,m,k,x,y,t,cnt=1;
int vis[1010][1010];
int main(){
//	freopen("explore.in","r",stdin);
//	freopen("explore.out","w",stdout);
	cin>>t;
	char a[1010][1010];
	for (int e = 1;e<=t;e++){
		cin>>n>>m>>k>>x>>y>>d;

		for (int i = 1;i<=n;i++){
			for (int j = 1;j<=m;j++){
				cin>>a[i][j];
			}
		}cnt = 1;
		while(k>0){
			if (d == 0){
				if (y+1>=1 && y+1<=m && a[x][y+1] == '.' ){
					y+=1;
					if (vis[x][y] == 0){
						cnt++;
					}
					vis[x][y] = 1;
				}else{
					d = (d+1)%4;
				}
				k--;
			}else if(d == 1){
				if (x+1>=1&&x+1<=n && a[x+1][y] == '.'){
					x+=1; 
					if (vis[x][y] == 0){
						cnt++;
					}
					vis[x][y] = 1;
				}else{
					d = (d+1)%4;
				}
				k--;
			}else if(d == 2){
				if (y-1>=1 &&y-1<=m&& a[x][y-1] == '.'){
					y-=1; 
					if (vis[x][y] == 0){
						cnt++;
					}
					vis[x][y] = 1;
				}else{
					d = (d+1)%4;
				}
				k--;
			}else{
				if (x-1>=1 &&x-1<=n&& a[x-1][y] == '.'){
					x-=1;
					if (vis[x][y] == 0){
						cnt++;
					}
					vis[x][y] = 1;
				}else{
					d = (d+1)%4;
				}
				k--;
			}	
		}
		cout<<cnt<<endl;
		memset(vis,0,sizeof(vis));
		memset(a,'0',sizeof(a));	
	}
	return 0;
}