B"One day Ms Swan bought an orange in a shop. The orange consisted of n xc2 xb7k segments, numbered with integers from 1 to n xc2 xb7k. There were k children waiting for Ms Swan at home. The children have recently learned about the orange and they decided to divide it between them. For that each child took a piece of paper and wrote the number of the segment that he would like to get: the i-th (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89i xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89k) child wrote the number ai (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xc2 xb7k). All numbers ai accidentally turned out to be different. Now the children wonder, how to divide the orange so as to meet these conditions: Help the children, divide the orange and fulfill the requirements, described above. The first line contains two integers n, k (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n, xe2 x80 x89k xe2 x80 x89 xe2 x89 xa4 xe2 x80 x8930). The second line contains k space-separated integers a1, xe2 x80 x89a2, xe2 x80 x89..., xe2 x80 x89ak (1 xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89ai xe2 x80 x89 xe2 x89 xa4 xe2 x80 x89n xc2 xb7k), where ai is the number of the orange segment that the i-th child would like to get. It is guaranteed that all numbers ai are distinct. Print exactly n xc2 xb7k distinct integers. The first n integers represent the indexes of the segments the first child will get, the second n integers represent the indexes of the segments the second child will get, and so on. Separate the printed numbers with whitespaces. You can print a child's segment indexes in any order. It is guaranteed that the answer always exists. If there are multiple correct answers, print any of them."...