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

public class MainCodeforces1 {
	private static MyScanner in;
	private static PrintStream out;

	public static void main(String[] args) throws IOException {
		// helpers for input/output
		boolean LOCAL_TEST = false;
		// LOCAL_TEST = true;// comment it before submitting
		out = System.out;
		if (LOCAL_TEST) {
			in = new MyScanner("E:\\zin2.txt");
		}
		else {
			boolean usingFileForIO = false;
			if (usingFileForIO) {
				// using input.txt and output.txt as I/O
				in = new MyScanner("input.txt");
				out = new PrintStream("output.txt");
			}
			else {
				in = new MyScanner();
				out = System.out;
			}
		}
		solve();
	}

	private static void solve() throws IOException
	{
		int N = in.nextInt();
		int K = in.nextInt();
		// int[] nums = new int[K];
		boolean[] used = new boolean[N * K + 1];
		for (int i = 1; i <= N * K; i++) {
			used[i] = false;
		}
		Map<Integer, List<Integer>> map = new HashMap<Integer, List<Integer>>();
		for (int i = 1; i <= K; i++) {
			int x = in.nextInt();
			List<Integer> l = new ArrayList<Integer>();
			l.add(x);
			used[x] = true;
			map.put(i, l);
		}
		int iused = 1;
		for (int i = 1; i <= K; i++) {
			List<Integer> ls = map.get(i);
			while (ls.size() < N) {
				while (used[iused]) {
					iused++;
				}
				used[iused] = true;
				ls.add(iused);
			}
			map.put(i, ls);
		}
		for (int i = 1; i <= K; i++) {
			List<Integer> ls = map.get(i);
			for (int j = 0; j < ls.size(); j++) {
				if (j > 0)
					out.print(" ");
				out.print(ls.get(j));
			}
			out.println();
		}
	}

	static class MyScanner {
		StreamTokenizer in;

		public MyScanner() throws IOException
		{
			Reader r = new BufferedReader(new InputStreamReader(System.in));
			in = new StreamTokenizer(r);
		}

		public MyScanner(String inputFile) throws IOException {
			Reader r;
			r = new BufferedReader(new FileReader(inputFile));
			in = new StreamTokenizer(r);
		}

		public int nextInt() throws IOException {
			in.nextToken();
			return (int) in.nval;
		}

		public long nextLong() throws IOException {
			in.nextToken();
			return (long) in.nval;
		}

		public double nextDouble() throws IOException {
			in.nextToken();
			return in.nval;
		}

		public String nextString() throws IOException {
			in.nextToken();
			return in.sval;
		}
	}

}
