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 #include<set>
10 using std::cin;
11 using std::cout;
12 using std::endl;
13 using std::find;
14 using std::sort;
15 using std::pair;
16 using std::queue;
17 using std::vector;
18 #define pb(e) push_back(e)
19 #define sz(c) (int)(c).size()
20 #define mp(a, b) make_pair(a, b)
21 #define all(c) (c).begin(), (c).end()
22 #define iter(c) decltype((c).begin())
23 #define cls(arr,val) memset(arr,val,sizeof(arr))
24 #define cpresent(c, e) (find(all(c), (e)) != (c).end())
25 #define rep(i, n) for (int i = 0; i < (int)(n); i++)
26 #define tr(c, i) for (iter(c) i = (c).begin(); i != (c).end(); ++i)
27 const int N = 110;
28 const int INF = ~0u >> 1;
29 typedef unsigned long long ull;
30 char maze[N][N];
31 bool vis[N][N][11];
32 int r, c, k, Sx, Sy, Dx, Dy;
33 const int dx[4] = { -1, 1, 0, 0 }, dy[4] = { 0, 0, -1, 1 };
34 struct Node {
35     int x, y, s;
36     Node(int i = 0, int j = 0, int k = 0) :x(i), y(j), s(k) {}
37 };
38 queue<Node> que;
39 void bfs() {
40     cls(vis, 0);
41     while (!que.empty()) que.pop();
42     que.push(Node(Sx, Sy, 0));
43     vis[Sx][Sy][0] = 1;
44     while (!que.empty()) {
45         Node tp = que.front(); que.pop();
46         if (tp.x == Dx && tp.y == Dy) { printf("%d\n", tp.s); return; }
47         rep(i, 4) {
48             int nx = dx[i] + tp.x, ny = dy[i] + tp.y, ns = tp.s + 1;
49             if (nx < 0 || nx >= r || ny < 0 || ny >= c || vis[nx][ny][ns % k]) continue;
50             if (maze[nx][ny] == ‘#‘ && ns % k != 0) continue;
51             vis[nx][ny][ns % k] = 1;
52             que.push(Node(nx, ny, ns));
53         }
54     }
55     puts("Please give me another chance!");
56 }
57 int main() {
58 #ifdef LOCAL
59     freopen("in.txt", "r", stdin);
60     freopen("out.txt", "w+", stdout);
61 #endif
62     int t;
63     scanf("%d", &t);
64     while (t--) {
65         scanf("%d %d %d", &r, &c, &k);
66         rep(i, r) {
67             scanf("%s", maze[i]);
68             rep(j, c) {
69                 if (maze[i][j] == ‘Y‘) Sx = i, Sy = j;
70                 else if (maze[i][j] == ‘G‘) Dx = i, Dy = j;
71             }
72         }
73         bfs();
74     }
75     return 0;
76 }