Fork Copy [Problem] There is a maze as shown in the diagram below. In the maze in the form of a 16*16 matrix, the white background represents the road while the yellow background represents the wall. Assuming the upper left corner block to be (0, 0), the horizontal direction to be x direction and vertical direction to be y direction, the starting point of the maze is (1. 1) and the arriving point is (13, 13). Create a program to determine if there is a path to reach the arriving point from the starting point. [Input] The first line of the input file provides the test case number. The test cases are followed in next lines. Total of 10 test cases are given. In each test case, 1 refers to the wall, 0 refers to the road, 2 refers to the starting point and 3 refers to the arriving point. [Output] The output file outputs the test case number following the ‘#’ symbol. It is followed by a space, 0 or 1 to indicate whether the arriving point can be reached (1 - yes, 0 – no). [Input Example] 1 1111111111111111 1210000000100011 1010101110101111 1000100010100011 1111111010101011 1000000010101011 1011111110111011 1010000010001011 1010101111101011 1010100010001011 1010111010111011 1010001000100011 1011101111101011 1000100000001311 1111111111111111 1111111111111111 2 1111111111111111 1200000010000011 1011111011111011 1000001010000011 1110101010111011 1010101010100011 1011111010111111 1000001010000011 1011101011111011 1010101010000011 1010101010111111 1010100000130011 1010111111111011 1000000000000011 1111111111111111 1111111111111111 ... [Output Example] #1 1 #2 1