B"Casimir has a rectangular piece of paper with a checkered field of size n x 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: An already painted cell will remain black if painted again. Below you can find an example of the 4 x 9 box, with two ticks of sizes 2 and 3 . You are given a description of a checkered field of size n x 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 ge k for all the ticks). Determine whether this field can indeed be obtained by drawing some (possibly none) ticks of sizes d ge k or not. The first line contains an integer t ( 1 <= q t <= q 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. 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). The fi"...