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.BufferedInputStream;
import java.util.Arrays;
import java.util.Scanner;

/**
 * Created by jizhe on 2015/12/25.
 */
public class PaintingPebbles {
    public static void main(String[] args) {
        Scanner in = new Scanner(new BufferedInputStream(System.in));

        int N = in.nextInt();
        int K = in.nextInt();
        int[] pebbles = new int[N];

        int max = Integer.MIN_VALUE, all = 0;
        for( int i = 0; i < N; i++ )
        {
            pebbles[i] = in.nextInt();
            all += pebbles[i];
            if( pebbles[i] > max )
            {
                max = pebbles[i];
            }
        }
        int[][] colors = new int[N][max];
        int[][] stat = new int[N][K];
        for( int i = 0; i < N; i++ )
        {
            Arrays.fill(colors[i], 0);
            Arrays.fill(stat[i], 0);
        }

        while( all > 0 ) {
            //System.out.printf("all: %d\n", all);
            for (int i = 0; i < K; i++) {
                //System.out.printf("color i: %d\n", i);
                for (int j = 0; j < N; j++) {
                    if (pebbles[j] > 0) {
                        colors[j][pebbles[j] - 1] = i + 1;
                        pebbles[j]--;
                        all--;
                        stat[j][i]++;
                    }
                }
            }
        }

        /*for( int i = 0; i < N; i++ )
        {
            for( int j = 0; j < K; j++ )
            {
                System.out.printf("%d ", stat[i][j]);
            }
            System.out.printf("\n");
        }*/

        for( int i = 0; i < K; i++ )
        {
            int maxx = Integer.MIN_VALUE, min = Integer.MAX_VALUE;
            for( int j = 0; j < N; j++ )
            {
                if( stat[j][i] > maxx )
                {
                    maxx = stat[j][i];
                }
                if( stat[j][i] < min )
                {
                    min = stat[j][i];
                }
            }
            if( maxx - min > 1 )
            {
                //System.out.printf("maxx: %d, min: %d\n", maxx, min);
                System.out.printf("NO\n");
                return;
            }
        }

        System.out.printf("YES\n");
        for( int i = 0; i < N; i++ )
        {
            for( int j = 0; j < max; j++ )
            {
                if( colors[i][j] == 0 )
                {
                    break;
                }
                else
                {
                    System.out.printf("%d ", colors[i][j]);
                }
            }
            System.out.printf("\n");
        }

        /*for( int i = 0; i < N; i++ )
        {
            System.out.printf("%d ", pebbles[i]);
        }
        System.out.printf("\n");*/

    }
}