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.IOException;
import java.io.InputStreamReader;

public class PaintingPubbles {
    public static void main(String[] args) throws NumberFormatException,
            IOException {
        BufferedReader reader = new BufferedReader(new InputStreamReader(
                System.in));
        String[] nos = reader.readLine().split("\\s");
        int max = Integer.parseInt(nos[0]);
        int limit = Integer.parseInt(nos[1]);
        int[] numbers = new int[max];
        String[] input = reader.readLine().split("\\s");
        int maxi = Integer.MAX_VALUE;
        int mini = Integer.MIN_VALUE;
        for (int i = 0; i <= input.length - 1; i++) {
            numbers[i] = Integer.parseInt(input[i]);

            if (numbers[i] < maxi) {
                maxi = numbers[i];
            }

            if (numbers[i] > mini) {
                mini = numbers[i];
            }
        }

        int[] minarray = new int[100];
        int[] maxarray = new int[100];
        for (int i = 0, j = 1; i <= maxi - 1; i++, j++) {
            minarray[j - 1] = ++minarray[j - 1];
            if (j == limit) {
                j = 0;
            }
        }
        for (int i = 0, j = 1; i <= mini - 1; i++, j++) {
            maxarray[j - 1] = ++maxarray[j - 1];
            if (j == limit) {
                j = 0;
            }
        }

        boolean check = true;

        for (int i = 0; i <= 99; i++) {
            if (Math.abs(maxarray[i] - minarray[i]) > 1) {
                System.out.println("NO");
                check = false;
                break;
            }
        }

        if (check) {
            System.out.println("YES");
            for (int i = 0; i <= numbers.length - 1; i++) {
                for (int j = 1, k = 1; j <= numbers[i]; j++, k++) {
                    System.out.print(k + " ");
                    if (k == limit) {
                        k = 0;
                    }
                }
                System.out.println();
            }
        }

    }
}
