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.lang.reflect.Array;
import java.util.Arrays;
import java.util.StringTokenizer;


public class paintingPepples {
public static void main(String[]args) throws IOException{
	BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
	StringTokenizer str=new StringTokenizer(br.readLine());
			int piles=Integer.parseInt( str.nextToken());
			int color=Integer.parseInt( str.nextToken());
			int[][]solution=new int[piles][color];
			String st=br.readLine();
			StringTokenizer st1=new StringTokenizer(st);

			int [] pepples=new int [piles];
			for (int i = 0; i < pepples.length; i++) {
				pepples[i]=Integer.parseInt(st1.nextToken());
			}
for (int i = 0; i <solution.length; i++) {
	if(pepples[i]>color){
	//	System.out.println("3w");
		Arrays.fill(solution[i], pepples[i]/color);
		for (int j = 0; j < pepples[i]%color; j++) {
			solution[i][j]++;
		}
	}else{
		Arrays.fill(solution[i], 0);
		for (int j = 0; j < pepples[i]; j++) {
			solution[i][j]++;
		}
	}
	
	
}
/*for (int i = 0; i < solution.length; i++) {
	for (int j = 0; j < solution[i].length; j++) {
		System.out.print(solution[i][j]);
		
	}System.out.println();
}*/

boolean check=true;
int min =0;
int max=0;
for (int i = 0; i < color; i++) {
	min =solution[0][i];
	max=solution[0][i];
	for (int j = 0; j < piles; j++) {
		if(solution[j][i]>max)
			max=solution[j][i];
if(solution[j][i]<min)
	min=solution[j][i];
		
	}
	if(max-min>1){
		check=false;
	break;}
	
}
if(check==true){
	System.out.println("YES");
	for (int i = 0; i < solution.length; i++) {
		for (int j = 0; j < color; j++) {
			if (solution[i][j]==0) {
				break;
			}else{
				
				for (int j2 = 0; j2 < solution[i][j]; j2++) {
					System.out.print(j+1+" ");
				}
			}
		}System.out.println();
	}

}
else
	System.out.println("NO");





}
	
}
