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.*;

public class Main3 {
    static MyScanner sc;

    public static void main(String[] args) {
        sc = new MyScanner();
        out = new PrintWriter(new BufferedOutputStream(System.out));
        //Dividing Orange
        solution();
    }

    private static void solution() {
        int n = sc.nextInt();
        int k = sc.nextInt();

        ArrayList<Integer> result = new ArrayList<Integer>();
        if (k == 1) {
            for (int h = 0; h < n * k; h++) {
                result.add(h + 1);
            }
        } else {
            for (int h = 0; h < k; h++) {
                result.add(sc.nextInt());
            }
            for (int ch = 0; ch < k; ch++) {
                int addCount = n - 1;
                for (int i = 0; i < n*k && addCount > 0; i++) {
                    if (!result.contains(i + 1)) {
                        result.add(ch * n, i + 1);
                        addCount--;
                    }
                }
            }
        }

        for (int h = 0; h < n * k; h++) {
            out.print(result.get(h));
            out.print(" ");
        }
        out.close();
    }

    private static Vector<Integer> createZeroVector(int n) {
        Vector<Integer> result = new Vector<Integer>();
        for (int k = 0; k < n; k++) {
            result.add(0);
        }
        return result;
    }

    private static int readN() {
        int result = 0;
        try {
            result = Integer.parseInt(sc.next());
        } catch (Exception ioe) {
            ioe.printStackTrace();
        }
        return result;
    }

    //-----------PrintWriter for faster output---------------------------------
    public static PrintWriter out;

    //-----------MyScanner class for faster input----------
    public static class MyScanner {
        BufferedReader br;
        StringTokenizer st;

        public MyScanner() {
            br = new BufferedReader(new InputStreamReader(System.in));
        }

        String next() {
            while (st == null || !st.hasMoreElements()) {
                try {
                    st = new StringTokenizer(br.readLine());
                } catch (IOException e) {
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }

        int nextInt() {
            return Integer.parseInt(next());
        }

        long nextLong() {
            return Long.parseLong(next());
        }

        double nextDouble() {
            return Double.parseDouble(next());
        }

        String nextLine() {
            String str = "";
            try {
                str = br.readLine();
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

        String nextString(int length) {
            String str = "";
            try {
                char[] buff = new char[length];
                br.read(buff);
                str = new String(buff);
            } catch (IOException e) {
                e.printStackTrace();
            }
            return str;
        }

    }
    //--------------------------------------------------------
}