#include<bits/stdc++.h>

using namespace std;

int T,ans = 1,l;
int n,m,k;
int bx,by,d;
int dx[] = {0,1,0,-1};
int dy[] = {1,0,-1,0};
char mp[1005][1005];
bool vis[1005][1005],f = 1;

bool in(int xx,int yy) { return xx>=1&&xx<=n&&yy>=1&&yy<=m&&mp[xx][yy]=='.'; }

void dfs(int x,int y)
{
	for(int i = 0;i<4;i++)
	{
		if(l >= k) return ;
		l++;
		int nx = x + dx[d%4];
		int ny = y + dy[d%4];
		if(in(nx,ny))
		{
			vis[nx][ny] = 1;
			f = 0;
			dfs(nx,ny);
		}
		else d++;
	}
}

int main()
{
	ios::sync_with_stdio(0),cin.tie(0),cout.tie(0);
	cin>>T;
	while(T--)
	{
		cin>>n>>m>>k;
		cin>>bx>>by>>d;
		vis[bx][by] = 1;
		for(int i = 1;i<=n;i++) for(int j = 1;j<=m;j++) cin>>mp[i][j],vis[i][j] = 0;
		dfs(bx,by);
		for(int i = 1;i<=n;i++) for(int j = 1;j<=m;j++) if(vis[i][j]) ans++;
		cout<<ans<<"\n";
		ans = 1,l = 0,f = 1;
	}
	return 0;
}