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.BufferedReader;
import java.io.BufferedWriter;
import java.io.File;
import java.io.FileWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStream;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class A244 {
  static FastScanner in;
  static FastPrinter out;
  
  public static void main(String[] args) throws IOException {
    in = new FastScanner(System.in);
    out = new FastPrinter(System.out);
    
    int n = in.nextInt();
    int k = in.nextInt();
    boolean[] used = new boolean[n * k];
    int[][] sets = new int[k][n];
    for (int i = 0; i < k; i++) {
      int want = in.nextInt() - 1;
      sets[i][0] = want;
      used[want] = true;
    }
    int ii = 0;
    for (int i = 0; i < k; i++) {
      out.printf("%d", sets[i][0] + 1);
      for (int j = 1; j < n; j++) {
        while (used[ii])
          ii++;
        sets[i][j] = ii++;
        out.printf(" %d", sets[i][j] + 1);
      }
      out.println();
    }
    out.close();
  }
  
  static class FastPrinter extends PrintWriter {
    public FastPrinter(File f) throws IOException {
      super(new BufferedWriter(new FileWriter(f)));
    }
    
    public FastPrinter(OutputStream out) throws IOException {
      super(new BufferedWriter(new OutputStreamWriter(out)));
    }
  }
  
  static class FastScanner {
    BufferedReader br;
    StringTokenizer st;
    
    public FastScanner(InputStream in) {
      br = new BufferedReader(new InputStreamReader(in));
      st = new StringTokenizer("");
    }
    
    public int nextInt() throws IOException {
      return Integer.parseInt(next());
    }
    
    public long nextLong() throws IOException {
      return Long.parseLong(next());
    }
    
    public double nextDouble() throws IOException {
      return Double.parseDouble(next());
    }
    
    public String next() throws IOException {
      if (st.hasMoreTokens()) return st.nextToken();
      st = new StringTokenizer(br.readLine());
      return next();
    }
  }
  
}
