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;
import java.util.StringTokenizer;

/**
 * Created by saksham on 19-08-2016.
 * 509B
 */
public class PaintingPebbles {
    public static void main(String []args) throws IOException {
        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        StringTokenizer st = new StringTokenizer(br.readLine(), " ");
        int n = Integer.parseInt(st.nextToken());
        int k = Integer.parseInt(st.nextToken());
        int[] piles = new int[n];
        int i = 0, j = 0, diff = 0;
        st = new StringTokenizer(br.readLine(), " ");
        for(i = 0; i < n; i++) {
            piles[i] = Integer.parseInt(st.nextToken());
        }
        for(i = 0; i < n-1; i++) {
            for(j = i+1; j < n; j++) {
                diff = piles[i] - piles[j];
                if(diff < 0) diff = -diff;
                if(diff > k) {
                    System.out.println("NO");
                    return;
                }
            }
        }
        System.out.println("YES");
        int color = 1;
        for(i = 0; i < n; i++) {
            for(j = 0; j < piles[i]; j++) {
                if(color > k) color = 1;
                System.out.print(color + " ");
                color++;
            }
            System.out.println();
            color = 1;
        }
    }
}
