B'There are n dormitories in Berland State University, they are numbered with integers from 1 to n . Each dormitory consists of rooms, there are a_i rooms in i -th dormitory. The rooms in i -th dormitory are numbered from 1 to a_i . A postman delivers letters. Sometimes there is no specific dormitory and room number in it on an envelope. Instead of it only a room number among all rooms of all n dormitories is written on an envelope. In this case, assume that all the rooms are numbered from 1 to a_1 + a_2 + ... + a_n and the rooms of the first dormitory go first, the rooms of the second dormitory go after them and so on. For example, in case n=2 , a_1=3 and a_2=5 an envelope can have any integer from 1 to 8 written on it. If the number 7 is written on an envelope, it means that the letter should be delivered to the room number 4 of the second dormitory. For each of m letters by the room number among all n dormitories, determine the particular dormitory and the room number in a dormitory where this letter should be delivered. The first line contains two integers n and m (1 <= n, m <= 2 cdot 10^{5}) -- the number of dormitories and the number of letters. The second line contains a sequence a_1, a_2, ... , a_n (1 <= a_i <= 10^{10}) , where a_i equals to the number of rooms in the i -th dormitory. The third line contains a sequence b_1, b_2, ... , b_m (1 <= b_j <= a_1 + a_2 + ... + a_n) , where b_j equals to the room number (among all rooms of all dormitories) for the j -th letter. All b_j are given in increasing order. Print m lines. For each letter print two integers f and k -- the dormitory number f (1 <= f <= n) and the room number k in this dormitory (1 <= k <= a_f) to deliver the letter. In the first example letters s'...