Problem: There are n piles of pebbles on the table, the i-th pile contains ai pebbles. Your task is to paint each pebble using one of the k given colors so that for each color c and any two piles i and j the difference between the number of pebbles of color c in pile i and number of pebbles of color c in pile j is at most one.

In other words, let's say that bi, c is the number of pebbles of color c in the i-th pile. Then for any 1 ≤ c ≤ k, 1 ≤ i, j ≤ n the following condition must be satisfied |bi, c - bj, c| ≤ 1. It isn't necessary to use all k colors: if color c hasn't been used in pile i, then bi, c is considered to be zero.

Input

The first line of the input contains positive integers n and k (1 ≤ n, k ≤ 100), separated by a space — the number of piles and the number of colors respectively.

The second line contains n positive integers a1, a2, ..., an (1 ≤ ai ≤ 100) denoting number of pebbles in each of the piles.

Output

If there is no way to paint the pebbles satisfying the given condition, output "NO" (without quotes) .

Otherwise in the first line output "YES" (without quotes). Then n lines should follow, the i-th of them should contain ai space-separated integers. j-th (1 ≤ j ≤ ai) of these integers should be equal to the color of the j-th pebble in the i-th pile. If there are several possible answers, you may output any of them.

Examples

Input

4 4
1 2 3 4


Output

YES
1
1 4
1 2 4
1 2 3 4


Input

5 2
3 2 4 1 3


Output

NO


Input

5 4
3 2 4 3 5


Output

YES
1 2 3
1 3
1 2 3 4
1 3 4
1 1 2 3 4

Solution (in JAVA):

Solution:
import java.io.*;
import java.util.*;

public class paintpebbles {
  private static InputReader in;
  private static PrintWriter out;
  
  static class Num implements Comparable<Num> {
    public int a,b;
    public Num(int a, int b) {
      this.a = a;
      this.b = b;
    }
    public int compareTo(Num other) {
      return a - other.a;
    }
  }

  public static void main(String[] args) throws IOException {
    in = new InputReader(System.in);
    out = new PrintWriter(System.out, true);
    int N = in.nextInt(), K = in.nextInt();
    Num[] arr = new Num[N];

    int[][] r = new int[N][];
    int[] id = new int[N];
    for (int i = 0; i < N; i++) {
      arr[i] = new Num(in.nextInt(), i);
      r[i] = new int[arr[i].a];
    }
    Arrays.sort(arr);
    
    int m = arr[0].a+1;
    for (int k = 0; k < N; k++) {
      int take = Math.min(arr[k].a, m);
      arr[k].a -= take;
      while (take-->0) r[arr[k].b][id[arr[k].b]++] = 1;
    }
    
    int uc = 1;
    for (int j = 1; j < N; j++) {
      if (arr[j].a == 0) continue;
      while (arr[j].a > 0) {
        uc++;
        for (int k = j; k < N; k++) {
          arr[k].a--;
          r[arr[k].b][id[arr[k].b]++] = uc;
        }
      }
      
    }
    
    if (uc >= K+1) {
      out.println("NO");
    } else {
      out.println("YES");
      for (int i = 0; i < N; i++) {
        out.print(r[i][0]);
        for (int j = 1; j < r[i].length; j++)
          out.print(" "+r[i][j]);
        out.println();
      }
    }
    out.close();
    System.exit(0);
  }

  static class InputReader {
    public BufferedReader reader;
    public StringTokenizer tokenizer;

    public InputReader(InputStream stream) {
      reader = new BufferedReader(new InputStreamReader(stream), 32768);
      tokenizer = null;
    }

    public String next() {
      while (tokenizer == null || !tokenizer.hasMoreTokens()) {
        try {
          tokenizer = new StringTokenizer(reader.readLine());
        } catch (IOException e) {
          throw new RuntimeException(e);
        }
      }
      return tokenizer.nextToken();
    }

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


}