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

public class Main {

    public static void main(String args[]) throws Exception {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

        int[] nk = t_int_a(br, 2);

        boolean[] slice = new boolean[nk[0] * nk[1]];

        int[] des = t_int_a(br, nk[1]);

        for (int i : des) {
            slice[i - 1] = true;
        }

        int[][] got = new int[nk[1]][nk[0]];

        for (int i = 0; i < nk[1]; i++) {
            got[i][0] = des[i];
            for (int j = 0; j < nk[0] - 1; j++) {
                got[i][j + 1] = next_free(slice) + 1;
                System.out.print(got[i][j + 1] + " ");
            }
            System.out.println(got[i][0]);
        }


        br.close();
    }

    public static int next_free(boolean[] a) {
        int i = 0;
        for (; i < a.length; i++) {
            if (a[i] == false) {
                a[i] = true;
                return i;
            }
        }
        return -1;
    }

    public static int t_int(BufferedReader br) throws Exception {
        return Integer.parseInt(br.readLine());
    }

    public static StringTokenizer t_st(BufferedReader br) throws Exception {
        return new StringTokenizer(br.readLine());
    }

    public static int[] t_int_a(BufferedReader br, int n) throws Exception {
        StringTokenizer st = t_st(br);
        int[] a = new int[n];
        for (int i = 0; i < n; i++) {
            a[i] = Integer.parseInt(st.nextToken());
        }
        return a;
    }
}