Grid Pattern

Games commonly found on Unix systems in the 1970s and 1980s were designed in text mode. Many of these games use a grid as their basic layout, placing pieces or items in rows and columns. Classic examples are tic-tac-toe, chess, and minesweeper. Your task is to design a simple text-based grid layout engine that these games can use.

Given the dimensions, print a text-based grid pattern. Use | (pipe) for vertical lines, - (minus) for horizontal lines, and + (plus) where lines cross. Fill every other position with * (asterisk).

The first line contains a positive integer $N$ ($1 \le N \le 100$), the number of test cases. Each of the next $N$ lines contains four positive integers $row$, $col$, $w$, and $h$: the number of rows, the number of columns, and the width and height of a single cell. ($1 \le row, col \le 10$, $1 \le w, h \le 5$)

For each test case, first print a line in the format Case #x:, where $x$ is the case number starting from 1. Then print the grid pattern.

The grid pattern has $row \cdot (h+1) + 1$ lines, each of length $col \cdot (w+1) + 1$. A border line is + followed by $col$ repetitions of $w$ copies of - and one +. A cell line is | followed by $col$ repetitions of $w$ copies of * and one |. The pattern starts with a border line, and each row adds $h$ cell lines followed by one border line. See the sample output for the exact format.