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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.nio.Buffer;
import java.util.*;

public class Hamburgers {
    static class FastReader {
        BufferedReader br;
        StringTokenizer st;

        public FastReader() {
            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;
        }
    }
    private static int gcd(int a , int b){
        return (a%b==0)?b:gcd(b,a%b);
    }

    private static int primes(int a){
        int ct=0;
        while (a % 2 == 0)
        {
            ct++;
            a = a/2;
        }
        while (a % 3 == 0)
        {
            ct++;
            a = a/3;
        }
        while (a % 5 == 0)
        {
            ct++;
            a = a/5;
        }
        if(a==1) return ct;
        return -1;

    }
    static List<Long> ls=new ArrayList<Long>();

    private static void rec(long num,int ct4,int ct7){
        if(num>=(long)1e10)
            return;
        if(ct4==ct7)
            ls.add(num);
        rec(num*10+4,ct4+1,ct7);
        rec(num*10+7,ct4,ct7+1);
    }

    private static List<Integer> seive(){
        int n=(int)1e5+7;
        boolean [] primes=new boolean[n+1];
        Arrays.fill(primes,true);
        for(int i=2;i*i<=n;i++){
            if(primes[i]==true){
                for(int j=i*i;j<=n;j+=i){
                    primes[j]=false;
                }
            }
        }
        int i=2;
        List<Integer> ls=new ArrayList<>();
        while(i<=n){
            if(primes[i]==true)
              ls.add(i);
            i++;
        }
        return ls;
    }

    private static int[] getArray(BufferedReader b) throws IOException {

        String s=b.readLine();

        String[] S=s.split(" ");
        int arr[]=new int[S.length];
        for(int i=0;i<S.length;i++){
            arr[i]=Integer.parseInt(S[i]);
        }
        return arr;
    }

    private static int binarySearch(int target,List<Integer> ls){
        int l=0;
        int r=ls.size();
        while(l<r){
            int mid=l+(r-l)/2;
            if(ls.get(mid)>target)
                r=mid;
            else l=mid+1;
        }
        if(l==0)
            return ls.get(l);
        if(ls.get(l-1)==target)
            return ls.get(l-1);
        return ls.get(l);
    }


    public static void main(String[] args) throws IOException {
        // Scanner in=new Scanner(System.in);
        FastReader in = new FastReader();
        int n = in.nextInt();
        int k = in.nextInt();
        int arr[] = new int[n * k + 1];
        int note[] = new int[n * k + 1];
        for (int i = 1; i <= k; i++) {
            note[i] = in.nextInt();
            arr[note[i]] = -1;
        }
        int j = 1;
        for (int i = 1; i <= k; i++) {
            System.out.print(note[i] + " ");
            int ct = 0;
            while (ct < n-1 && j <= n * k) {
                if (arr[j] != -1) {
                    System.out.print(j + " ");
                    j++;
                    ct++;

                } else j++;
            }
            System.out.print("\n");
        }


    }

       }