China's cinemas are reopening after being closed for six months to help slow the spread of the coronavirus.
Apollo has a cinema which contains n rows of seats and there are m seats in each
row. We'll represent the seat on the x-th row and the y-th column as a pair of numbers (x, y). According to the policy, people in cinemas need to keep social distance. So two people can not sit at two neighboring seats.
Two seats , are considered to be neighboring if they have a common edge, i.e .
People will come to the box office to buy tickets one by one, and they are allowed to choose seats themselves. People can choose any valid seats. A seat is valid if it is not chosen by others and not neighboring with others' seats. The cinema cashier will stop sell tickets if there are no valid seats. As the boss of the cinema, Apollo wants to know the minimum number of tickets that can be sold in the worst case. We can assume there are enough people to buy tickets (i.e. the cinema cashier will continue to sell tickets until there are no valid seats).

The first line of the input gives the number of test case,  ().  test cases follow.
Each test case consists of one line with two integers n () and m (), denoting the number of rows and the number of columns.

For each test case, output one line containing , where x is the test case number (starting from 1) and y is the minimum number of tickets that can be sold in the worst case. Then, print n more lines of m characters each, representing a situation that can only sell y tickets. "*" means the seat is selected, "." means the seat is not selected.
If there are multiple valid answers, you may output any one of them.

3
3 3
4 5
1 5

Case #1: 3
*.*
...
.*.
Case #2: 6
..*.*
*....
...*.
.*..*
Case #3: 2
.*.*.