Problem: 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 

Solution (in JAVA):

Solution:
import java.io.IOException;


public class Orange {

	/**
	 * @param args
	 */
	public static void main(String[] args) {
		// TODO Auto-generated method stub
		java.io.InputStreamReader converter = new java.io.InputStreamReader(System.in);
		java.io.BufferedReader in = new java.io.BufferedReader(converter);
		
		String line1 = "";
		String line2 = "";
		try {
			line1 = in.readLine();
			line2 = in.readLine();
		} catch (IOException e) {
		}
		
		SplitOranges(line1, line2);
	}

	public static void SplitOranges(String line1, String line2)
	{
		String[] nAndK = line1.split(" ");
		String[] aNumber = line2.split(" ");
		
		int N = Integer.parseInt(nAndK[0]);
		int K = Integer.parseInt(nAndK[1]);
		int[] A = new int[K];
		
		int[] seg = new int[N * K];		
		
		for(int k = 0; k < K; k++)
		{
			A[k] = Integer.parseInt(aNumber[k]);
			seg[A[k] - 1] = k + 1;
			A[k] = 1;
		}
		
		int chIdx = 0;
		for(int s = 0; s < N * K; s++)
		{
			if(seg[s] != 0)
				continue;
			
			if(A[chIdx] != N)
			{
				seg[s] = chIdx+1;
				A[chIdx]++;
				if(A[chIdx] == N)
				{
					chIdx++;
				}
			}
		}
		
		String[] results = new String[K];
		for(int k = 0; k < K; k++)
		{
			results[k] = "";
		}
		
		for(int s = 0; s < N * K; s++)
		{
			results[seg[s] - 1] += (s + 1) + " ";
		}
		
		//System.out.println("There are: " + aNumber.length + " children.");
		for(int k = 0; k < K; k++)
		{			
			System.out.print(results[k].trim());
			
			System.out.println();
		}
	}
}