1 #include<cstdio>
 2 #include<queue>
 3 #include<cstring>
 4 using namespace std;
 5 
 6 struct point
 7 {
 8     int x,y;
 9     int cnt;
10 };
11 
12 char map[105][105];
13 int m,n,ex,ey,sx,sy,lim;
14 int vis[105][105];
15 int d[4][2]={0,1,1,0,-1,0,0,-1};
16 
17 bool bfs(int x,int y)
18 {
19     queue<point>q;
20     point init;
21     init.x=x,init.y=y;
22     init.cnt=-1;
23     vis[x][y]=1;
24     q.push(init);
25     while(!q.empty())
26     {
27         point t1,t2;
28         t1=q.front();
29         q.pop();
30         if(t1.cnt>=lim)
31         continue;
32         for(int i=0;i<4;i++)
33         {
34             t2.x=t1.x+d[i][0];
35             t2.y=t1.y+d[i][1];
36             t2.cnt=t1.cnt+1;
37             while(1)
38             {
39                 if(map[t2.x][t2.y]==‘*‘||t2.x<=0||t2.x>m||t2.y<=0||t2.y>n)
40                 break;
41                 if(t2.x==ex&&t2.y==ey)
42                   return true;
43                 if(!vis[t2.x][t2.y])
44                 {
45                     q.push(t2);
46                     vis[t2.x][t2.y]=1;
47                 }
48                 t2.x+=d[i][0];
49                 t2.y+=d[i][1];
50             }
51         }
52     }
53     return false;
54 }
55 
56 int main()
57 {
58     //freopen("in.txt","r",stdin);
59     int t;
60     scanf("%d",&t);
61     while(t--)
62     {
63         memset(vis,0,sizeof(vis));
64         scanf("%d%d",&m,&n);
65         for(int i=1;i<=m;i++)
66         {
67             getchar();
68             for(int j=1;j<=n;j++)
69             scanf("%c",&map[i][j]);
70         }
71         scanf("%d%d%d%d%d",&lim,&sy,&sx,&ey,&ex);
72         if(bfs(sx,sy))
73         printf("yes\n");
74         else
75         printf("no\n");
76     }
77     return 0;
78 }