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.BufferedOutputStream;
import java.io.BufferedReader;
import java.io.File;
import java.io.FileInputStream;
import java.io.FileOutputStream;
import java.io.IOException;
import java.io.InputStreamReader;

public class Main {

	public static void main(String [] args ) {
		try{
			BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
			BufferedOutputStream bos = new BufferedOutputStream(System.out);
			String eol = System.getProperty("line.separator");
			byte [] eolb = eol.getBytes();
			byte[] spaceb= " ".getBytes();
			String str  = br.readLine();
			int blank = str.indexOf( " ");
			int n = Integer.parseInt(str.substring(0,blank));
			int m = Integer.parseInt(str.substring(blank+1));
			int [] val = new int[n*m];
			int j=0;
			int s=0;
			int k =0;
			str = br.readLine();
			int length = str.length();
			for(int i = 0 ; i < (n*m) ; i++) {
				val[i] = -1;
			}
			while(j<length) {
				while(j<length) {
					if(str.charAt(j) == ' ') {
						break;
					}else {
						j++;
					}
				}
				val[Integer.parseInt(str.substring(s,j))-1] = k;
				k++;
				j++;
				s=j;			
			}
			int iter1 = 0;
			int iter2 = 1;
			int iter3 = 0;
			while(iter1<(n*m)) {
				if(val[iter1] == -1 ) {
					if(iter2<n) {
						val[iter1] = iter3;
						iter2++;
						iter1++;
					} else {
						iter2 = 1;
						iter3++;
					}
				} else {
					iter1++;
				}
			}
			for(int p = 0 ; p < m ; p++) {
				iter1 = 0;
				for(int i = 0 ; i < (n*m) ; i++) {
					if(val[i]==p) {
						bos.write(new Integer(i+1).toString().getBytes());
						iter1++;
						if(iter1 < n) {
							bos.write(spaceb);
						}
					}
				}
				bos.write(eolb);
			}
			bos.flush();
		}  catch(IOException ioe) {
			ioe.printStackTrace();
		}
	}
}
