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.*;
import java.util.*;

public class Adiv2 implements Runnable {

	private void Solution() throws IOException {
		int n = nextInt(), k = nextInt();
		int[] a = new int[k];
		boolean[] used = new boolean[n * k];
		for (int i = 0; i < k; i++) {
			a[i] = nextInt() - 1;
			used[a[i]] = true;
		}
		for (int i = 0; i < k; i++) {
			print(a[i] + 1);
			int cnt = 0;
			for (int j = 0; j < n * k; j++) {
				if (!used[j]) {
					print(' ');
					print(j + 1);
					used[j] = true;
					cnt++;
				}
				if (cnt == n - 1)
					break;
			}
			println();
		}
	}

	public static void main(String[] args) {
		new Adiv2().run();
	}

	BufferedReader in;
	PrintWriter out;
	StringTokenizer tokenizer;

	public void run() {
		try {
			long beginTime = System.nanoTime();
			long beginMemory = totalMemory() - freeMemory();

			in = new BufferedReader(new InputStreamReader(System.in));
			out = new PrintWriter(System.out);
			Solution();
			out.close();

			long endTime = System.nanoTime();
			long endMemory = totalMemory() - freeMemory();

			double totalTime = (endTime - beginTime) * 1d / 1000000000;
			double totalMemory = (endMemory - beginMemory) * 1d / 1024 / 1024;

			System.err.println();
			System.err.println();
			System.err.println("Time wasted - " + totalTime / 10 + " s");
			System.err.println("Memory used - " + totalMemory + " mb");
		} catch (Exception e) {
			e.printStackTrace();
			System.exit(0);
		}
	}

	void halt() {
		out.close();
		System.exit(0);
	}

	long totalMemory() {
		return Runtime.getRuntime().totalMemory();
	}

	long freeMemory() {
		return Runtime.getRuntime().freeMemory();
	}

	void print(Object... o) {
		for (int i = 0; i < o.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(o[i]);
		}
	}

	void println(Object... o) {
		for (int i = 0; i < o.length; i++) {
			if (i != 0)
				out.print(" ");
			out.print(o[i]);
		}
		out.println();
	}

	int nextInt() throws IOException {
		return Integer.parseInt(nextToken());
	}

	long nextLong() throws NumberFormatException, IOException {
		return Long.parseLong(nextToken());
	}

	double nextDouble() throws NumberFormatException, IOException {
		return Double.parseDouble(nextToken());
	}

	String nextLine() throws IOException {
		return in.readLine();
	}

	String nextToken() throws IOException {
		while (tokenizer == null || !tokenizer.hasMoreTokens())
			tokenizer = new StringTokenizer(nextLine());
		return tokenizer.nextToken();
	}
}
