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


public class PaintingPebbles {
static StringBuilder sb = new StringBuilder();
static int arr[];
static int N;
static int K;
	public static void main(String[]args) throws Throwable{
		M9 in = new M9(System.in);
		N = in.j(); K = in.j();
		int min = 200000000;
		int idxmin = -1;
		int max = -200000000;
		arr = new int[N];
		for(int i=0;i<N;i++){
			arr[i] = in.j();
			min = Math.min(arr[i], min);
			if(min==arr[i]) idxmin = i;
			max = Math.max(arr[i],max);
		}
		if(max>min+K){
			System.out.print("NO");
		return;
		}
		sb.append("YES\n");
		for(int i=0;i<N;i++){
			if(i==idxmin){
				for(int j=0;j<arr[i];j++) sb.append("1"+" ");
				sb.append("\n");
			}
			else{
				if(arr[i]<=min+1){ 
					for(int j=0;j<arr[i];j++) sb.append("1"+" ");
					sb.append("\n");
				}
				else{
						int k = 2;
						for(int j=0;j<min+1;j++) sb.append("1"+" ");
						for(int j=min+1;j<arr[i];j++) sb.append((k++)+" ");
						sb.append("\n");
					}
					
				}
			}
		
		System.out.print(sb);
	}
}


class M9 {
	public BufferedReader reader;
	public StringTokenizer tokenizer;

	public M9(InputStream stream) {
		reader = new BufferedReader(new InputStreamReader(stream), 32768);
		tokenizer = null;
	}

	public String next() {
		while (tokenizer == null || !tokenizer.hasMoreTokens()) {
			try {
				tokenizer = new StringTokenizer(reader.readLine());
			} catch (IOException e) {
				throw new RuntimeException(e);
			}
		}
		return tokenizer.nextToken();
	}

	public int j() {
		return Integer.parseInt(next());
	}

}