B"There're n robots placed on a number line. Initially, i -th of them occupies unit segment [x_i, x_i + 1] . Each robot has a program, consisting of k instructions numbered from 1 to k . The robot performs instructions in a cycle. Each instruction is described by an integer number. Let's denote the number corresponding to the j -th instruction of the i -th robot as f_{i, j} . Initial placement of robots corresponds to the moment of time 0 . During one second from moment of time t ( 0 <= t ) until t + 1 the following process occurs: An illustration of the process happening during one second: Rectangles represent robots. Numbers inside rectangles correspond to instructions of robots. The final division into groups is marked with arcs. Below are the positions of the robots after moving. Only the left of the two rightmost groups moved. That's because these two groups tried to move towards each other, and were separated by exactly one unit segment. Look at the examples for a better understanding of the process. You need to answer several questions. What is the position of a_i -th robot at the moment of time t_i ? The first line contains two integer numbers n and k -- the number of robots and the number of instructions in the program of one robot ( 1 <= n <= 100 , 1 <= k <= 50 ). The next line contains n integer numbers x_i -- positions of robots at moment of time 0 ( -10^9 <= x_1 < x_2 < ... < x_n < 10^9 ). The next n lines contain descriptions of robots' programs. The i -th of these lines contains k integer numbers f_{i, j} ( |f_{i, j}| <= 10^6 ). The next line contains a single integer number q -- the number of questions you to answer ( 1 <= q <= 1000 ). The next q lines contain two integer number a_i and t_i each, meaning that you should find a position of a_i -t"...