#include<cstdio>
#include<cstring>
#include<algorithm>
#include<queue>
#define maxn 1550
#define maxm 40009
#define inf 9999999
using namespace std;struct edge
{int from,to,cap,flow;edge() {}edge(int from,int to,int cap,int flow):from(from),to(to),cap(cap),flow(flow) {}
};struct dinic
{int n,m,s,t;edge edges[maxm*2];int head[maxn];int next[maxm*2];bool inq[maxn];int d[maxn];int cur[maxn];void init(int n){this->n=n;m=0;memset(head,-1,sizeof(head[0])*(n+1));}void addedge(int from,int to,int cap){next[m]=head[from];edges[m]=edge(from,to,cap,0);head[from]=m++;next[m]=head[to];edges[m]=edge(to,from,0,0);head[to]=m++;}bool bfs(){memset(inq,0,sizeof(inq[0])*(n+1));queue<int>q;q.push(s);d[s]=0;inq[s]=1;while(!q.empty()){int u=q.front();q.pop();for(int i=head[u]; i!=-1; i=next[i]){edge& e=edges[i];int v=e.to;if(!inq[v]&&e.cap>e.flow){inq[v]=1;d[v]=d[u]+1;q.push(v);if(v==t)return 1;}}}return 0;}int dfs(int u,int a){if(u==t||a==0)return a;int flow=0,f;for(int&i=cur[u]; i!=-1; i=next[i]){edge& e=edges[i];int v=e.to;if(d[u]+1==d[v]&&(f=dfs(v,min(a,e.cap-e.flow)))>0){e.flow+=f;edges[i^1].flow-=f;flow+=f;a-=f;if(a==0)break;}}return flow;}int maxflow(int s,int t){this->s=s;this->t=t;int flow=0;while(bfs()){memcpy(cur,head,sizeof(head[0])*(n+1));flow+=dfs(s,inf);}return flow;}
};dinic solve;struct node
{int x,y;
} no[maxn];
char s[100];
int main()
{
//    freopen("test0.in","r",stdin);int t;int n,m,d;scanf("%d",&t);while(t--){int cnt=1;scanf("%d%d%d",&n,&m,&d);for(int i=1; i<=n; i++){scanf("%s",s+1);for(int j=1; j<=m; j++){if(s[j]=='*'){no[cnt].x=i;no[cnt++].y=j;}}}int sr=0;int tr=2*cnt+1;solve.init(2*cnt+2);for(int i=1; i<cnt; i++){solve.addedge(2*i,2*i+1,1);if((no[i].x-1)<=d||((m-no[i].y)<=d))solve.addedge(sr,2*i,inf-1);if((n-no[i].x)<=d||(no[i].y-1)<=d)solve.addedge(2*i+1,tr,inf-1);}for(int i=1; i<cnt; i++)for(int j=1; j<cnt; j++){int dis=abs(no[i].x-no[j].x)+abs(no[i].y-no[j].y);if(no[i].x==no[j].x||no[i].y==no[j].y){if(dis<=2*d+1)solve.addedge(2*i+1,2*j,inf-1);}else{if(dis<=2*d+2)solve.addedge(2*i+1,2*j,inf-1);}}printf("%d\n",solve.maxflow(sr,tr));}return 0;
}