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;

/**
 * Created by DELL on 04-Mar-16.
 */
public class Main
{
    private String tokens[];
    private BufferedReader br = new BufferedReader(new InputStreamReader(System.in));

    public static void main(String ar[]) throws IOException
    {
        Main demo = new Main();
        demo.solve();
    }

    public void solve() throws IOException
    {
        tokens = br.readLine().split(" ");
        int pegs = Integer.parseInt(tokens[0]);
        int colors = Integer.parseInt(tokens[1]);
        int a[][] = new int[pegs][100];

        int min = 101;
        int max = 0;
        tokens = br.readLine().split(" ");
        for (int i = 0; i < pegs; i++)
        {
            a[i][0] = Integer.parseInt(tokens[i]);
            min = Math.min(a[i][0], min);
            max = Math.max(a[i][0], max);
        }
        if ( max - min > colors )
        {
            System.out.println("NO");
            return;
        } else
        {
            for (int i = 0; i < a.length; i++)
            {
                a[i][1] += min;
                a[i][0] -= min;
            }
            int color = 1;
            boolean isAllPlaced = true;
            while (true)
            {
                isAllPlaced = true;
                for (int i = 0; i < a.length; i++)
                {
                    if ( a[i][0] > 0 )
                    {
                        a[i][0]--;
                        a[i][color]++;
                    }
                }
                for (int i = 0; i < a.length; i++)
                {
                    if ( a[i][0] != 0 )
                    {
                        isAllPlaced = false;
                        break;
                    }
                }
                if ( isAllPlaced )
                {
                    System.out.println("YES");
                    for (int i = 0; i < a.length; i++)
                    {
                        for (int j = 1; j < a[i].length && a[i][j] != 0; j++)
                        {
                            while (a[i][j]-- > 0)
                            {
                                System.out.print(j + " ");
                            }
                        }
                        System.out.println();
                    }
                    return;
                }
                color++;
            }
        }
    }
}
