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.io.PrintWriter;
import java.util.Arrays;


public class Main {
	
	public static int[] add(int[]col, int k) {
		int[] c = new int[col.length];
		for (int i=0;i<c.length;i++) c[i] = col[i];
		
		for (int i=0;i<k;i++) c[i]++;
		return c;
	}
	
	public static void main(String[] args) throws IOException {
		BufferedReader in = new BufferedReader(new InputStreamReader(System.in));
		PrintWriter out = new PrintWriter(System.out);

		String[] tok = in.readLine().split(" ");
		int N = Integer.parseInt(tok[0]);
		int K = Integer.parseInt(tok[1]);

		int[] p = new int[N];
		int min = 101, max = 0;
		tok = in.readLine().split(" ");
		for (int i=0;i<N;i++) {
			p[i] = Integer.parseInt(tok[i]);
			min = Math.min(min, p[i]);
			max = Math.max(max, p[i]);
		}
		
				
		if (min+K>=max) {
			out.println("YES");

			int[] cols = new int[K];
			
			// Init coloring
			Arrays.fill(cols, min/K);
			for (int i=0;i<(min-(min/K*K));i++) cols[i]++;

			for (int i=0;i<N;i++) {
				//print
				int[]c = add(cols, (p[i]-min));
				for (int a=0;a<c.length;a++) {
					for (int b=0;b<c[a];b++) {
						out.print((a+1)+" ");
					}
				}
				out.println();
				
			}
			
		} else {
			out.println("NO");
		}
		
		in.close();
		out.close();
	}
}
