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 
import java.io.BufferedReader;
import java.io.ByteArrayInputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.Random;


public class PlayGround {

	public static void main(String[] args) throws Exception {
		Eduardo();

	}
	
	public static void Eduardo() throws IOException{

		

		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String input = br.readLine();
		String[] inputArray = new String[2];
		int[] values = new int[2];
		inputArray = input.split(" ");
		for(int i =0; i<inputArray.length; i++){
			values[i] = Integer.parseInt(inputArray[i]);
		}
		int n = values[0];
		int k = values[1];
		String input1 = br.readLine();
		String[] inputArray1 = new String[k];
		int[] values1 = new int[k];
		inputArray1 = input1.split(" ");
		ArrayList<Integer> checker = new ArrayList();
		for(int i =0; i<inputArray1.length; i++){
			values1[i] = Integer.parseInt(inputArray1[i]);
			checker.add(values1[i]);
		}
		
		int max = n*k;
		int[] possibleValues = new int[max-k];
		int counter = 0;
		for(int i = 0; i<max; i++){
			if(!checker.contains(i+1)){
				possibleValues[counter]=i+1;
				counter++;
			}
		}
		StringBuilder sb = new StringBuilder();
		int pointer = 0;
		for(int i = 0; i<k; i++){
			sb.append(values1[i] + " ");
			int count = n-1;
			while(count>0){
				sb.append(possibleValues[pointer] + " ");
				count--;
				pointer++; 
			}
			sb.append("\n");
		}
		System.out.println(sb);

			
		}
}