Your friend needs some support in his exam. You will send him a message hidden in a matrix. Only you and your friend know the starting position. Then you will encode the message in the following way.

The matrix is a 2D integer array. Assume that the first byte is the least significant byte of the integer number. int num =(B4 B3 B2 B1). The first byte (B1) contains a hidden char, the next two bytes (B2 and B3) of every number is encoded in a way so that you can get the x (B2) and y (B3) coordinate of the next position in the array. You know that the message stops when B1 = (B2+B3).

Question: Write a program that reads a 2D matrix and prints the hidden message.

Input specification: You will be given three integers (n) in the beginning, and the starting coordinate (x, y) of the message. The following n lines will have n integers where 0 < n ≤ 100 and matrix values are integers less than 2e9. Note: array positions are integers between 1 and n.

Output specification: Show the hidden message.

Explanation: The matrix is 5 by 5, and you know that you will start from (2,4). The number (66371)₁₀ is (10000001101000011) ₂ where first byte is 67 = (01000011)₂ which is the char 'C' in the ASCII table. The second byte is 3 (00000011)₂ which is the x coordinate of the next char. The third byte is 1 = (00000001)₂, the y coordinate of the next char. Thus, the second char is hidden in (3,1): (197199)₁₀ is (110000001001001111) ₂, and the hidden char is 79 = (001001111)₂ which is the char 'O' in the ASCII table.

The char at (1,2) is 'R' and it points to (5,4) where the secret message ends because B1 = B2 + B3 (263433)₁₀ is (100 00000101 00001001)₂.