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.util.ArrayList;
import java.util.List;
import java.util.Scanner;

public class B509 {

    public static void main(String[] args) {
        Scanner input = new Scanner(System.in);
        int N = input.nextInt();
        int K = input.nextInt();
        int[] A = new int[N];
        int min = 101;
        int max = 0;
        for (int n=0; n<N; n++) {
            int value = input.nextInt();
            min = Math.min(min, value);
            max = Math.max(max, value);
            A[n] = value;
        }
        if (max - min > K) {
            System.out.println("NO");
        } else {
            List<Integer>[] lists = new List[N];
            for (int n=0; n<N; n++) {
                lists[n] = new ArrayList<Integer>();
            }
            for (int n=0; n<N; n++) {
                for (int i=0; i<min; i++) {
                    lists[n].add(1);
                }
                A[n] -= min;
            }
            for (int k=1; k<=K; k++) {
                for (int n=0; n<N; n++) {
                    if (A[n] > 0) {
                        lists[n].add(k);
                        A[n]--;
                    }
                }
            }
            System.out.println("YES");
            StringBuilder output = new StringBuilder();
            for (int n=0; n<N; n++) {
                for (int i=0; i<lists[n].size(); i++) {
                    if (i != 0) {
                        output.append(' ');
                    }
                    output.append(lists[n].get(i));
                }
                output.append('\n');
            }
            System.out.print(output);
        }
    }

}