B"Grandfather Ahmed's School has n+1 students. The students are divided into k classes, and s_i students study in the i -th class. So, s_1 + s_2 + ldots + s_k = n+1 . Due to the upcoming April Fools' Day, all students will receive gifts! Grandfather Ahmed planned to order n+1 boxes of gifts. Each box can contain one or more gifts. He plans to distribute the boxes between classes so that the following conditions are satisfied: Unfortunately, Grandfather Ahmed ordered only n boxes with gifts, the i -th of which contains a_i gifts. Ahmed has to buy the missing gift box, and the number of gifts in the box should be an integer between 1 and 10^6 . Help Ahmed to determine, how many gifts should the missing box contain, and build a suitable distribution of boxes to classes, or report that this is impossible. The first line of the input contains two integers n and k ( 1 <= n, k <= 200 , k <= n + 1 ). The second line contains n integers a_1, a_2, ldots, a_n ( 1 <= a_i <= 10^6 ) -- the number of gifts in the available boxes. The third line contains k integers s_1, s_2, ldots, s_k ( 1 <= s_i <= n+1 ) -- the number of students in classes. It is guaranteed that sum s_i = n+1 . If there is no way to buy the remaining box, output the integer -1 in a single line. Otherwise, in the first line, output a single integer s -- the number of gifts in the box that Grandfather Ahmed should buy ( 1 <= s <= 10^6 ). Next, in k lines, print the distribution of boxes to classes. In the i -th line print s_i integers -- the sizes of the boxes that should be sent to the i -th class. If there are multiple solutions, print any of them. In the first test, Grandfather Ahmed can buy a box with just 1 gift. After that, two boxes with 7 gifts are sent to the first class. 7 + 7 = 14 is divisible by 2$$"...