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;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Collections;
import java.util.StringTokenizer;

public class TB {

	public static void main(String[] args) {
		FastScanner in=new FastScanner();
		PrintWriter out=new PrintWriter(System.out);
		int i,j,k,N,K;
		N=in.nextInt();
		K=in.nextInt();
		int[] a=new int[N+1];
		for(i=1;i<=N;i++)
			a[i]=in.nextInt();
		
		ArrayList<ArrayList<Integer>> ans=new ArrayList<ArrayList<Integer>>();
		for(i=0;i<=N;i++){
			ans.add(new ArrayList<Integer>());
		}
		
		int[][] max=new int[N+1][K+1];
		for(i=1;i<=N;i++){
			for(j=1;j<=a[i];j++){
				if(j>K){
					if(j%K==0){
						ans.get(i).add(K);
						max[i][K]++;
					}else{
						ans.get(i).add(j%K);
						max[i][j%K]++;
					}
				}else{
					ans.get(i).add(j);
					max[i][j]++;
				}
			}
		}
		for(i=1;i<=N;i++){
			Collections.sort(ans.get(i));
		}
		for(i=1;i<=N;i++){
			for(j=i+1;j<=N;j++){
				for(k=1;k<=K;k++){
					if(Math.abs(max[i][k]-max[j][k])>1){
						out.println("NO");
						out.flush();
						return;
					}
				}
			}
		}
		
		out.println("YES");
		for(i=1;i<=N;i++){
			for(j=0;j<ans.get(i).size();j++){
				out.print(ans.get(i).get(j)+" ");
			}
			out.println();
		}
		out.flush();
	}
	static class FastScanner{
		BufferedReader br;
		StringTokenizer st;
		public FastScanner(){br=new BufferedReader(new InputStreamReader(System.in));}
		String nextToken(){
			while(st==null||!st.hasMoreElements())
				try{st=new StringTokenizer(br.readLine());}catch(Exception e){}
			return st.nextToken();
		}
		int nextInt(){return Integer.parseInt(nextToken());}
		long nextLong(){return Long.parseLong(nextToken());}
		double nextDouble(){return Double.parseDouble(nextToken());}
	}
}
