Problem: Pay attention to the output section below, where you will see the information about flushing the output.

Bearland is a grid with h rows and w columns. Rows are numbered 1 through h from top to bottom. Columns are numbered 1 through w from left to right. Every cell is either allowed (denoted by '.' in the input) or permanently blocked (denoted by '#').

Bearland is a cold land, where heavy snow often makes travelling harder. Every day a few allowed cells are temporarily blocked by snow. Note, that this block works only on this particular day and next day any of these cells might be allowed again (unless there is another temporarily block).

It's possible to move directly between two cells only if they share a side and none of them is permanently or temporarily blocked.

Limak is a little polar bear who lives in Bearland. His house is at the top left cell, while his school is at the bottom right cell. Every day Limak should first go from his house to the school and then return back to his house. Since he gets bored easily, he doesn't want to visit the same cell twice on one day, except for the cell with his house, where he starts and ends. If Limak can reach a school and return home avoiding revisiting cells, he calls a day interesting.

There are q days you must process, one after another. For each of these days you should check if it's interesting and print "YES" or "NO" on a separate line. In order to be able to read the description of the next day you should print the answer for the previous one and flush the output.

It's guaranteed that a day with no cells temporarily blocked by snow would be interesting. It's also guaranteed that cells with Limak's house and school are never blocked (neither permanently or temporarily).

Input

The first line of the input contains three integers h, w and q (2 ≤ h, w ≤ 1000, 1 ≤ q ≤ 10 000) — the height and the width of the grid, and the number of days, respectively.

Next h lines describe which cells are allowed and which permanently blocked. The i-th line contains a string of length w, describing the i-th row. Every character is either '.' (denoting an allowed cell) or '#' (denoting a permanently blocked cell). It's guaranteed that a day with no cells temporarily blocked by snow would be interesting.

Then, the description of q days is given. The description of the i-th day starts with a line containing a single integer ki (1 ≤ ki ≤ 10) — the number of cells that are temporarily blocked by snow on that day. Each of next ki lines contains two integers ri, j and ci, j (1 ≤ ri, j ≤ h, 1 ≤ ci, j ≤ w), representing a cell at the intersection of the row ri, j and the column ci, j. The given ki cells are distinct and none of them is permanently blocked. Also, none of them contains Limak's house or school.

Output

For each of q days print "YES" if that day is interesting, and otherwise print "NO", both without the quotes. After printing an answer, you have to both print the end-of-line character and flush the output. Then you can proceed to the next day. You can get Idleness Limit Exceeded if you don't print anything or if you forget to flush the output.

To flush you can use (just after printing a YES/NO and end-of-line): 

  * fflush(stdout) in C++; 
  * System.out.flush() in Java; 
  * stdout.flush() in Python; 
  * flush(output) in Pascal; 
  * See the documentation for other languages. 

Examples

Input

3 5 4
.....
.....
.#...
1
1 4
1
1 5
2
2 4
3 1
2
1 5
3 3


Output

NO
YES
YES
NO


Input

9 31 5
...............................
...............................
.###.###.#.###...###.###.#.###.
...#.#.#.#.#.......#.#.#.#...#.
.###.#.#.#.###...###.#.#.#...#.
.#...#.#.#.#.#...#...#.#.#...#.
.###.###.#.###...###.###.#...#.
...............................
...............................
5
6 5
2 11
1 14
8 15
2 14
5
2 14
1 14
8 16
6 5
2 11
3
2 2
1 4
8 30
10
3 1
3 11
5 16
7 21
4 16
3 5
7 31
3 9
7 25
3 27
10
3 1
3 9
7 25
3 27
7 21
4 17
3 5
7 31
4 16
3 11


Output

NO
YES
YES
YES
NO

Note

In the first sample, there are 4 days. Drawings below show how Limak could go to school and return to his home in the second and the third day (on the left and on the right respectively). A permanently blocked cell is painted red, while cells temporarily blocked by snow are painted orange. Black and green arrows should Limak's way to the school and back to the house respectively.

<image>

For the second sample, below you can see how the grid looks like on each day, where '#' denotes a cell that is blocked, either temporarily or permanently.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
const int N = 1e3 + 10, mov[8][2] = {{1, 1}, {1, -1}, {-1, 1}, {-1, -1},
                                     {1, 0}, {-1, 0}, {0, 1},  {0, -1}};
int n, m, q, k, cnt, flag, x[10], y[10], f[10], tanc[100], anc[N * N];
char str[N];
bool a[N][N];
std::set<int> pre[N * N];
std::map<int, int> map;
inline int id(int i, int j) { return i * (m + 2) + j; }
inline int find(int x) { return anc[x] == x ? x : anc[x] = find(anc[x]); }
inline int findt(int x) { return tanc[x] == x ? x : tanc[x] = findt(tanc[x]); }
inline void merge(int u, int v) { anc[find(u)] = find(v); }
inline void merget(int u, int v) { tanc[findt(u)] = findt(v); }
int main() {
  scanf("%d%d%d", &n, &m, &q);
  for (int i = 1; i <= n; i++) {
    scanf("%s", str + 1);
    for (int j = 1; j <= m; j++) a[i][j] = str[j] == '#';
  }
  for (int i = 0; i <= n + 1; i++)
    for (int j = 0; j <= m + 1; j++) anc[id(i, j)] = id(i, j);
  anc[id(0, 1)] = anc[id(n, m + 1)] = -1;
  anc[id(1, 0)] = anc[id(n + 1, m)] = -1;
  anc[id(0, 0)] = anc[id(n + 1, m + 1)] = -1;
  a[n + 1][0] = a[0][m + 1] = true;
  for (int i = 2; i <= n; i++) a[i][0] = true, merge(id(i, 0), id(i + 1, 0));
  for (int i = 1; i < n; i++)
    a[i][m + 1] = true, merge(id(i, m + 1), id(i - 1, m + 1));
  for (int i = 2; i <= m; i++) a[0][i] = true, merge(id(0, i), id(0, i + 1));
  for (int i = 1; i < m; i++)
    a[n + 1][i] = true, merge(id(n + 1, i), id(n + 1, i - 1));
  for (int i = 1; i <= n; i++)
    for (int j = 1; j <= m; j++)
      if (a[i][j])
        for (int k = 0; k < 8; k++)
          if (a[i + mov[k][0]][j + mov[k][1]])
            merge(id(i, j), id(i + mov[k][0], j + mov[k][1]));
  for (int i = 0; i <= n + 1; i++)
    for (int j = 0; j <= m + 1; j++)
      if (~anc[id(i, j)]) {
        find(id(i, j));
      }
  int S = anc[id(0, 2)], T = anc[id(2, 0)];
  auto solve = [&] {
    if (S == T) return true;
    for (int i = 0; i <= n + 1; i++)
      for (int j = 0; j <= m + 1; j++)
        if (anc[id(i, j)] == S || anc[id(i, j)] == T) {
          for (int p = 0; p < 8; p++) {
            if (i + mov[p][0] == 1 && j + mov[p][1] == 1) continue;
            if (i + mov[p][0] == n && j + mov[p][1] == m) continue;
            for (int q = 0; q < 8; q++) {
              int u = i + mov[p][0] + mov[q][0];
              int v = j + mov[p][1] + mov[q][1];
              if (u < 0 || v < 0 || u > n + 1 || v > m + 1) continue;
              if (anc[id(i, j)] == S && anc[id(u, v)] == T) return true;
              if (anc[id(i, j)] == T && anc[id(u, v)] == S) return true;
            }
          }
        }
    return false;
  };
  if (solve()) {
    fprintf(stderr, "no solution at all!\n");
    flag = true;
  } else {
    for (int i = 0; i <= n + 1; i++)
      for (int j = 0; j <= m + 1; j++)
        if (~anc[id(i, j)] && a[i][j]) {
          for (int p = 0; p < 8; p++) {
            if (i + mov[p][0] == 1 && j + mov[p][1] == 1) continue;
            if (i + mov[p][0] == n && j + mov[p][1] == m) continue;
            for (int q = 0; q < 8; q++) {
              int u = i + mov[p][0] + mov[q][0];
              int v = j + mov[p][1] + mov[q][1];
              if (u < 0 || v < 0 || u > n + 1 || v > m + 1) continue;
              if (~anc[id(u, v)] && a[u][v]) {
                if (anc[id(i, j)] != anc[id(u, v)])
                  pre[anc[id(i, j)]].insert(anc[id(u, v)]);
              }
            }
          }
        }
  }
  for (int i = 1; i <= q; i++) {
    scanf("%d", &k);
    for (int i = 0; i < k; i++) scanf("%d%d", &x[i], &y[i]);
    auto solve = [&] {
      if (flag) return true;
      map.clear(), cnt = 0;
      map[S] = map[T] = true;
      for (int i = 0; i < k; i++) {
        a[x[i]][y[i]] = true;
        map[anc[id(x[i], y[i])]] = true;
        for (int k = 0; k < 8; k++)
          if (a[x[i] + mov[k][0]][y[i] + mov[k][1]])
            map[anc[id(x[i] + mov[k][0], y[i] + mov[k][1])]] = true;
      }
      for (auto &it : map) it.second = cnt++;
      assert(cnt < 100);
      for (int i = 0; i < cnt; i++) tanc[i] = i;
      for (int i = 0; i < k; i++)
        for (int k = 0; k < 8; k++)
          if (a[x[i] + mov[k][0]][y[i] + mov[k][1]])
            merget(map[anc[id(x[i], y[i])]],
                   map[anc[id(x[i] + mov[k][0], y[i] + mov[k][1])]]);
      int s = findt(map[S]), t = findt(map[T]);
      if (s == t) return true;
      for (int i = 0; i < k; i++) f[i] = findt(map[anc[id(x[i], y[i])]]);
      for (int i = 0; i < k; i++)
        if (f[i] == s || f[i] == t) {
          for (int p = 0; p < 8; p++) {
            if (x[i] + mov[p][0] == 1 && y[i] + mov[p][1] == 1) continue;
            if (x[i] + mov[p][0] == n && y[i] + mov[p][1] == m) continue;
            for (int q = 0; q < 8; q++) {
              int u = x[i] + mov[p][0] + mov[q][0];
              int v = y[i] + mov[p][1] + mov[q][1];
              if (u < 0 || v < 0 || u > n + 1 || v > m + 1 || !~anc[id(u, v)] ||
                  !a[u][v])
                continue;
              int p = anc[id(u, v)];
              if (f[i] == s && (p == T || (map.count(p) && t == findt(map[p]))))
                return true;
              if (f[i] == t && (p == S || (map.count(p) && s == findt(map[p]))))
                return true;
            }
          }
        }
      for (const auto &x : map)
        if (findt(x.second) == s)
          for (const auto &y : map)
            if (findt(y.second) == t)
              if (pre[x.first].count(y.first)) {
                return true;
              }
      return false;
    };
    puts(solve() ? "NO" : "YES"), fflush(stdout);
    for (int i = 0; i < k; i++) a[x[i]][y[i]] = false;
  }
}