1 #include<algorithm>
 2 #include<iostream>
 3 #include<cstdlib>
 4 #include<cstring>
 5 #include<cstdio>
 6 #include<vector>
 7 #include<queue>
 8 #include<map>
 9 using std::cin;
10 using std::cout;
11 using std::endl;
12 using std::find;
13 using std::sort;
14 using std::map;
15 using std::pair;
16 using std::queue;
17 using std::vector;
18 using std::multimap;
19 #define pb(e) push_back(e)
20 #define sz(c) (int)(c).size()
21 #define mp(a, b) make_pair(a, b)
22 #define all(c) (c).begin(), (c).end()
23 #define iter(c) decltype((c).begin())
24 #define cls(arr,val) memset(arr,val,sizeof(arr))
25 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
26 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
27 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
28 const int N = 110;
29 typedef unsigned long long ull;
30 char G[N][N];
31 bool vis[N][N][11][4]; // 访问标志
32 int H, W, K, Sx, Sy, Dx, Dy;
33 const int dx[] = { 0, 0, -1, 1 }, dy[] = { -1, 1, 0, 0 };
34 struct Node{
35     // x坐标，y坐标 方向 转弯次数
36     int x, y, dir, turn;
37     Node() {}
38     Node(int i, int j, int k, int l) :x(i), y(j), dir(k), turn(l) {}
39 };
40 bool bfs() {
41     cls(vis, false);
42     queue<Node> q;
43     rep(i, 4) {
44         int x = Sx + dx[i], y = Sy + dy[i];
45         if (x < 0 || x >= H || y < 0 || y >= W || G[x][y] == '*') continue;
46         q.push(Node(x, y, i, 0));
47         vis[x][y][0][i] = true;
48     }
49     while (!q.empty()) {
50         Node t = q.front(); q.pop();
51         if (t.x == Dx && t.y == Dy) return true;
52         rep(i, 4) {
53             int x = t.x + dx[i], y = t.y + dy[i];
54             if (x < 0 || x >= H || y < 0 || y >= W || G[x][y] == '*') continue;
55             if (t.dir == i) {
56                 bool &p = vis[x][y][t.turn][i];
57                 if (!p) {
58                     q.push(Node(x, y, t.dir, t.turn));
59                     p = true;
60                 }
61             } else {
62                 bool &p = vis[x][y][t.turn + 1][i];
63                 if (t.turn + 1 <= K && !p) {
64                     q.push(Node(x, y, i, t.turn + 1));
65                     p = true;
66                 }
67             }
68         }
69     }
70     return false;
71 }
72 int main() {
73 #ifdef LOCAL
74     freopen("in.txt", "r", stdin);
75     freopen("out.txt", "w+", stdout);
76 #endif
77     int t;
78     scanf("%d", &t);
79     while (t--) {
80         scanf("%d %d", &H, &W);
81         rep(i, H) scanf("%s", G[i]);
82         scanf("%d %d %d %d %d", &K, &Sy, &Sx, &Dy, &Dx);
83         Sx--, Sy--, Dx--, Dy--;
84         puts(bfs() ? "yes" : "no");
85     }
86     return 0;
87 }