In this problem, we want to find plus signs hidden in a number table. All we know about these plus signs and the number table are the followings. (1) The plus signs may overlap. (2) The width and height of each plus sign range from 3 to 11 units. For each plus sign, its width and height are equal. (3) One unit length equals to one table entry. (4) There are 2 to 9 plus signs in each table and no part of a plus sign lies outside a table. (5) The centers of plus signs do not lie inside another plus sign. In other words, the center of each sign does not overlap with any part of another plus sign. (6) The value of each table entry is the number of plus signs in the entry. For example, if there are 3 plus signs overlap in a table entry, the value in this entry is 3. If there is none, the value is 0. For example, there are 2 plus signs in the following table. One sign has width of length 3 and another has width of length 5. The center of the first lies at row 2, column 2 of the number table, while the center of the second lies in row 3, column 3. The highlighted entries correspond to the centers of plus signs. Your task is to write a program to count the number of plus signs in each table and report the position of the last plus sign’s center. By last, it means the plus sign whose center lies lowest in a table. If there are multiple signs lie lowest, the center of the last plus sign is the rightmost among them. Input The first is the number of test cases T where 1 ≤ T ≤ 12. For each test case:
2/2 Sample Input 2 55 01100 11200 12111 00100 00100 10 11 00001100000 00001101000 00111221100 00122112200 00113100100 00021221111 01001110110 11101111311 01000010010 00000010000 Sample Output 2 33 9 8 10