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.*;
import java.util.*;

public class B {

	public static void main(String[] args)throws IOException {
		
		BufferedReader ob=new BufferedReader(new InputStreamReader(System.in));
		StringBuffer sb=new StringBuffer();
		
		String s[]=ob.readLine().split(" ");
		
		int n=Integer.parseInt(s[0]);
		int k=Integer.parseInt(s[1]);
		
		String str[]=ob.readLine().split(" ");
		List<Integer> a=new ArrayList<>();
		
		int min=Integer.MAX_VALUE;
		int max=Integer.MIN_VALUE;
		int rep=1;
		for(int i=0;i<n;i++)
		{
			int x=Integer.parseInt(str[i]);
			int temp=(int)Math.ceil((double)x/(double)k);
			if(temp>rep)
				rep=temp;
			a.add(x);
			if(x<min)
				min=x;
			if(x>max)
				max=x;
		}
		int dif=max-min;
		if(dif>k)
		{
			System.out.println("NO");
			return;
		}
		int clr=1;
		List<Integer> ans[]=new ArrayList[n];
		for(int i=0;i<n;i++)
			ans[i]=new ArrayList<>();
		
		int it=1;
		while(it<=rep)
		{
			if(clr>k)
			{
				clr=1;
				it++;
			}
			for(int i=0;i<n;i++)
			{
				int sz=a.get(i);
				int cmp=ans[i].size();
				if(sz==cmp)
					continue;
				ans[i].add(clr);
			}
			clr++;
		}
		System.out.println("YES");
		for(int i=0;i<n;i++)
		{
			print(ans[i]);
		}
	}
	static void print(List<Integer> a)
	{
		for(int i=0;i<a.size();i++)
			System.out.print(a.get(i)+" ");
		System.out.println();
	}
}
