description: Casimir has a rectangular piece of paper with a checkered field of size n × m. Initially, all cells of the field are white.
  
  Let us denote the cell with coordinates i vertically and j horizontally by (i, j). The upper left cell will be referred to as (1, 1) and the lower right cell as (n, m).
  
  Casimir draws ticks of different sizes on the field. A tick of size d (d > 0) with its center in cell (i, j) is drawn as follows: 
  
    1. First, the center cell (i, j) is painted black. 
    2. Then exactly d cells on the top-left diagonally to the center and exactly d cells on the top-right diagonally to the center are also painted black. 
    3. That is all the cells with coordinates (i - h, j ± h) for all h between 0 and d are painted. In particular, a tick consists of 2d + 1 black cells. 
  
  
  
  An already painted cell will remain black if painted again. Below you can find an example of the 4 × 9 box, with two ticks of sizes 2 and 3.
  
  <image>
  
  You are given a description of a checkered field of size n × m. Casimir claims that this field came about after he drew some (possibly 0) ticks on it. The ticks could be of different sizes, but the size of each tick is at least k (that is, d ≥ k for all the ticks).
  
  Determine whether this field can indeed be obtained by drawing some (possibly none) ticks of sizes d ≥ k or not.
  
  Input
  
  The first line contains an integer t (1 ≤ t ≤ 100) — the number test cases.
  
  The following lines contain the descriptions of the test cases. 
  
  The first line of the test case description contains the integers n, m, and k (1 ≤ k ≤ n ≤ 10; 1 ≤ m ≤ 19) — the field size and the minimum size of the ticks that Casimir drew. The following n lines describe the field: each line consists of m characters either being '.' if the corresponding cell is not yet painted or '*' otherwise.
  
  Output
  
  Print t lines, each line containing the answer to the corresponding test case. The answer to a test case should be YES if the given field can be obtained by drawing ticks of at least the given size and NO otherwise.
  
  You may print every letter in any case you want (so, for example, the strings yEs, yes, Yes, and YES will all be recognized as positive answers).
  
  Example
  
  Input
  
  
  8
  2 3 1
  *.*
  ...
  4 9 2
  *.*.*...*
  .*.*...*.
  ..*.*.*..
  .....*...
  4 4 1
  *.*.
  ****
  .**.
  ....
  5 5 1
  .....
  *...*
  .*.*.
  ..*.*
  ...*.
  5 5 2
  .....
  *...*
  .*.*.
  ..*.*
  ...*.
  4 7 1
  *.....*
  .....*.
  ..*.*..
  ...*...
  3 3 1
  ***
  ***
  ***
  3 5 1
  *...*
  .***.
  .**..
  
  
  Output
  
  
  NO
  YES
  YES
  YES
  NO
  NO
  NO
  NO
  
  Note
  
  The first sample test case consists of two asterisks neither of which can be independent ticks since ticks of size 0 don't exist.
  
  The second sample test case is already described in the statement (check the picture in the statement). This field can be obtained by drawing ticks of sizes 2 and 3, as shown in the figure.
  
  The field in the third sample test case corresponds to three ticks of size 1. Their center cells are marked with \color{blue}{blue}, \color{red}{red} and \color{green}{green} colors: *.*.  
  ---  
  *\color{blue}{*}**  
  .\color{green}{*}\color{red}{*}.  
  ....  
    
  The field in the fourth sample test case could have been obtained by drawing two ticks of sizes 1 and 2. Their vertices are marked below with \color{blue}{blue} and \color{red}{red} colors respectively: .....  
  ---  
  *...*  
  .*.*.  
  ..\color{red}{*}.*  
  ...\color{blue}{*}.  
    
  The field in the fifth sample test case can not be obtained because k = 2, and the last asterisk in the fourth row from the top with coordinates (4, 5) can only be a part of a tick of size 1.
  
  The field in the sixth sample test case can not be obtained because the top left asterisk (1, 1) can't be an independent tick, since the sizes of the ticks must be positive, and cannot be part of a tick with the center cell in the last row, since it is separated from it by a gap (a point, '.') in (2, 2).
  
  In the seventh sample test case, similarly, the field can not be obtained by the described process because the asterisks with coordinates (1, 2) (second cell in the first row), (3, 1) and (3, 3) (leftmost and rightmost cells in the bottom) can not be parts of any ticks.
solution: import java.io.IOException;
  import java.io.InputStream;
  import java.io.OutputStream;
  import java.io.PrintWriter;
  import java.math.BigInteger;
  import java.util.*;
  
  /**
   * @author Mubtasim Shahriar
   */
  
  public class Ticks {
  
      public static void main(String[] args) {
  
          InputStream inputStream = System.in;
          OutputStream outputStream = System.out;
          InputReader sc = new InputReader(inputStream);
          PrintWriter out = new PrintWriter(outputStream);
          Solver solver = new Solver();
  		int t = sc.nextInt();
  //        int t = 1;
          while (t-- != 0) {
              solver.solve(sc, out);
          }
          out.close();
  
      }
  
      static class Solver {
          public void solve(InputReader sc, PrintWriter out) {
              int n = sc.nextInt();
              int m = sc.nextInt();
              int k = sc.nextInt();
              char[][] arr = new char[n][m];
              for (int i = 0; i < n; i++) {
                  arr[i] = sc.next().toCharArray();
              }
              boolean[][] ok = new  boolean[n][m];
              for(int i = 0; i < n; i++) {
                  for (int j = 0; j < m; j++) {
                      if(arr[i][j]!='*') continue;
                      int min = getCells(arr,i,j);
                      if(min<k) continue;
                      ok[i][j] = true;
                      int row = i-1;
                      int lc = j-1;
                      int rc = j+1;
                      int painted = 0;
                      while(painted<min) {
                          ok[row][lc] = true;
                          ok[row][rc] = true;
                          row--;
                          lc--;
                          rc++;
                          painted++;
                      }
                  }
              }
              for(int i= 0; i < n; i++) {
                  for (int j = 0; j < m; j++) {
                      if(arr[i][j]=='*' && !ok[i][j]) {
                          out.println("NO");
                          return;
                      }
                  }
              }
              out.println("YES");
          }
  
          private int getCells(char[][] arr, int i, int j) {
              int total = 0;
              int n = arr.length;
              int m = arr[0].length;
              int row = i-1;
              int lc = j-1;
              int rc = j+1;
              while(true) {
                  if(!inRange(row,lc,n,m) || !inRange(row,rc,n,m)) break;
                  if(arr[row][lc]!='*' || arr[row][rc]!='*') break;
                  total++;
                  row--;
                  lc--;
                  rc++;
              }
              return total;
          }
  
          private boolean inRange(int i, int j, int n, int m) {
              return i>=0 && i<n && j>=0 && j<m;
          }
  
      }
  
      static void sort(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sort(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
      }
  
      static void sortDec(int[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static void sortDec(long[] arr) {
          Random rand = new Random();
          int n = arr.length;
          for (int i = 0; i < n; i++) {
              int idx = rand.nextInt(n);
              if (idx == i) continue;
              arr[i] ^= arr[idx];
              arr[idx] ^= arr[i];
              arr[i] ^= arr[idx];
          }
          Arrays.sort(arr);
          int l = 0;
          int r = n - 1;
          while (l < r) {
              arr[l] ^= arr[r];
              arr[r] ^= arr[l];
              arr[l] ^= arr[r];
              l++;
              r--;
          }
      }
  
      static class InputReader {
          private boolean finished = false;
  
          private InputStream stream;
          private byte[] buf = new byte[1024];
          private int curChar;
          private int numChars;
          private SpaceCharFilter filter;
  
          public InputReader(InputStream stream) {
              this.stream = stream;
          }
  
          public int read() {
              if (numChars == -1) {
                  throw new InputMismatchException();
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      throw new InputMismatchException();
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar++];
          }
  
          public int peek() {
              if (numChars == -1) {
                  return -1;
              }
              if (curChar >= numChars) {
                  curChar = 0;
                  try {
                      numChars = stream.read(buf);
                  } catch (IOException e) {
                      return -1;
                  }
                  if (numChars <= 0) {
                      return -1;
                  }
              }
              return buf[curChar];
          }
  
          public int nextInt() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              int res = 0;
              do {
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public long nextLong() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              long res = 0;
              do {
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              } while (!isSpaceChar(c));
              return res * sgn;
          }
  
          public String nextString() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              StringBuilder res = new StringBuilder();
              do {
                  if (Character.isValidCodePoint(c)) {
                      res.appendCodePoint(c);
                  }
                  c = read();
              } while (!isSpaceChar(c));
              return res.toString();
          }
  
          public boolean isSpaceChar(int c) {
              if (filter != null) {
                  return filter.isSpaceChar(c);
              }
              return isWhitespace(c);
          }
  
          public static boolean isWhitespace(int c) {
              return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
          }
  
          private String readLine0() {
              StringBuilder buf = new StringBuilder();
              int c = read();
              while (c != '\n' && c != -1) {
                  if (c != '\r') {
                      buf.appendCodePoint(c);
                  }
                  c = read();
              }
              return buf.toString();
          }
  
          public String readLine() {
              String s = readLine0();
              while (s.trim().length() == 0) {
                  s = readLine0();
              }
              return s;
          }
  
          public String readLine(boolean ignoreEmptyLines) {
              if (ignoreEmptyLines) {
                  return readLine();
              } else {
                  return readLine0();
              }
          }
  
          public BigInteger readBigInteger() {
              try {
                  return new BigInteger(nextString());
              } catch (NumberFormatException e) {
                  throw new InputMismatchException();
              }
          }
  
          public char nextCharacter() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              return (char) c;
          }
  
          public double nextDouble() {
              int c = read();
              while (isSpaceChar(c)) {
                  c = read();
              }
              int sgn = 1;
              if (c == '-') {
                  sgn = -1;
                  c = read();
              }
              double res = 0;
              while (!isSpaceChar(c) && c != '.') {
                  if (c == 'e' || c == 'E') {
                      return res * Math.pow(10, nextInt());
                  }
                  if (c < '0' || c > '9') {
                      throw new InputMismatchException();
                  }
                  res *= 10;
                  res += c - '0';
                  c = read();
              }
              if (c == '.') {
                  c = read();
                  double m = 1;
                  while (!isSpaceChar(c)) {
                      if (c == 'e' || c == 'E') {
                          return res * Math.pow(10, nextInt());
                      }
                      if (c < '0' || c > '9') {
                          throw new InputMismatchException();
                      }
                      m /= 10;
                      res += (c - '0') * m;
                      c = read();
                  }
              }
              return res * sgn;
          }
  
          public boolean isExhausted() {
              int value;
              while (isSpaceChar(value = peek()) && value != -1) {
                  read();
              }
              return value == -1;
          }
  
          public String next() {
              return nextString();
          }
  
          public SpaceCharFilter getFilter() {
              return filter;
          }
  
          public void setFilter(SpaceCharFilter filter) {
              this.filter = filter;
          }
  
          public interface SpaceCharFilter {
              public boolean isSpaceChar(int ch);
          }
  
          public int[] nextIntArray(int n) {
              int[] array = new int[n];
              for (int i = 0; i < n; ++i) array[i] = nextInt();
              return array;
          }
  
          public int[] nextSortedIntArray(int n) {
              int array[] = nextIntArray(n);
              Arrays.sort(array);
              return array;
          }
  
          public int[] nextSumIntArray(int n) {
              int[] array = new int[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextLongArray(int n) {
              long[] array = new long[n];
              for (int i = 0; i < n; ++i) array[i] = nextLong();
              return array;
          }
  
          public long[] nextSumLongArray(int n) {
              long[] array = new long[n];
              array[0] = nextInt();
              for (int i = 1; i < n; ++i) array[i] = array[i - 1] + nextInt();
              return array;
          }
  
          public long[] nextSortedLongArray(int n) {
              long array[] = nextLongArray(n);
              Arrays.sort(array);
              return array;
          }
      }
  
  
  }
  