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.InputStreamReader;


public class PaintingPebbles {

	public static void main(String[] args)  throws Exception{
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		String[] input = null;
		input = br.readLine().split(" ", 2);
		int n = Integer.parseInt(input[0]);
		int k = Integer.parseInt(input[1]);
		
		input = br.readLine().split(" ", n);
		int[] a = new int[n];
		int min = Integer.MAX_VALUE;
		int max = 0;
		for(int i=0;i<n;i++)
		{
			a[i] = Integer.parseInt(input[i]);
			if(a[i] < min)
				min = a[i];
			if(a[i] > max)
				max = a[i];
		}
		if( max - min > k)
			System.out.println("NO");
		else
		{
			colorPebbles(a,n,k,max);
		}
	}
	
	public static void colorPebbles(int[] a, int n, int K,int max)
	{
		int[][] col = new int[K][2];
		
		for(int i=0;i<K;i++)
		{
			col[i][0] = 0;
			col[i][1] = 1;
		}
		int[][] piles = new int[n][K];
		boolean colored = false;
		
		int zeroColor = -1;
		int zeroColorCount = 0;
		
		for(int i=0; i<max;i++)
		{
			zeroColor = -1;
			zeroColorCount = 0;
			
			for(int j=0; j<n;j++)
			{
				if(a[j] == 0)
				{
					continue;
				}
				colored = false;
				for(int k=0;k<K; k++)
				{
					if(piles[j][k] == col[k][1])
					{
						continue;
					}
					else if(piles[j][k] == col[k][0])
					{
						piles[j][k]++;
						colored = true;
						if(j == 0)
						{
							zeroColor = k;
							zeroColorCount = 1;
						}
						else
						{
							if(k == zeroColor)
							{
								zeroColorCount++;
							}
						}
						break;
					}
				}
				if(!colored)
				{
					System.out.println("NO");
					return;
				}
				a[j] --;
				if(zeroColorCount == n)
				{
					col[zeroColor][0] = col[zeroColor][1];
					col[zeroColor][1]++;
				}
			}
			
		}
		
		System.out.println("YES");
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<K;j++)
			{
				for(int k=0;k<piles[i][j];k++)
				{
					System.out.print((j+1)+" ");
				}
			}
			System.out.println();
		}
		
	}

}
