One day Ms Swan bought an orange in a shop. The orange consisted of n·k segments, numbered with integers from 1 to n·k. 

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 ≤ i ≤ k) child wrote the number ai (1 ≤ ai ≤ n·k). All numbers ai accidentally turned out to be different.

Now the children wonder, how to divide the orange so as to meet these conditions:

  * each child gets exactly n orange segments; 
  * the i-th child gets the segment with number ai for sure; 
  * no segment goes to two children simultaneously. 



Help the children, divide the orange and fulfill the requirements, described above.

Input

The first line contains two integers n, k (1 ≤ n, k ≤ 30). The second line contains k space-separated integers a1, a2, ..., ak (1 ≤ ai ≤ n·k), 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.

Output

Print exactly n·k 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.

Examples

Input

2 2
4 1


Output

2 4 
1 3 


Input

3 1
2


Output

3 2 1 
# http://codeforces.com/contest/244/problem/A

number_per_child, number_of_children = input().strip().split()
number_per_child = int(number_per_child)
number_of_children = int(number_of_children)

number_of_segs = number_of_children * number_per_child
priority = input().strip().split()

prefarence = {}
for i in range(0,len(priority)):
    priority[i] = int(priority[i])
    prefarence[priority[i]] = i
# print(prefarence)    


distribution = {}
for i in range(0,number_of_children):
    distribution[i] = []

temp = 1
for x in distribution:
    count = 0
    while(count < number_per_child - 1):
        if(not (temp in prefarence)):
            distribution[x].append(temp)
            temp = temp + 1
            count = count + 1
        else:
            temp = temp + 1


for x in prefarence:
    distribution[prefarence[x]].append(x)
# print(prefarence)
# print(distribution)

ans = ""
for x in distribution:
    for y in distribution[x]:
        ans = ans + str(y) + " "
    if (x != number_of_children - 1):
        ans = ans + "\n"


print(ans)
