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
import java.io.BufferedReader;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.util.ArrayList;
import java.util.List;
import java.util.StringTokenizer;

/**
 * User: dmitry
 */
public class Main {
    public static InputStream is = System.in;
    public static BufferedReader br = new BufferedReader(new InputStreamReader(is));
    public static StringTokenizer stok;

    public static String next() {
        String nxt;
        try {
            if (stok != null && stok.hasMoreElements()) return stok.nextToken();
            if ((nxt = br.readLine()) != null) {
                stok = new StringTokenizer(nxt);
                if (stok.hasMoreElements()) return stok.nextToken();
            } else return null;
        } catch (Exception e) {
            e.printStackTrace();
        }
        return null;
    }

    public static Integer nextInt() {
        return Integer.valueOf(next());
    }

    public static void main(String[] args) {
        int n = nextInt();
        int k = nextInt();
        int[] ar = new int[n];

        int sum = 0;
        for (int i = 0; i < ar.length; i++) {
            ar[i] = nextInt();
            sum += ar[i];
        }
        int maxDiff = Integer.MIN_VALUE;
        for (int i = 0; i < ar.length; i++) {
            for (int j = 0; j < ar.length; j++) {
                if (i != j) {
                    maxDiff = Math.max(maxDiff, Math.abs(ar[i] - ar[j]));
                }
            }
        }
        if (maxDiff > k) {
            System.out.println("NO");
            return;
        }
        List<Integer>[] masOf = new ArrayList[n];
        for (int i = 0; i < n; i++) {
            masOf[i] = new ArrayList<>();
        }

        while (sum > 0)
            for (int i = 0; i < n; i++) {
                for (int j = 1; j <= k; j++) {
                    if (masOf[i].size() < ar[i]) {
                        masOf[i].add(j);
                        sum--;
                    }
                }
            }
        System.out.println("YES");
        for (int i = 0; i < n; i++) {
            System.out.println();
            for (Integer res : masOf[i]) {
                System.out.print(res+" ");
            }
        }
    }
}