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.util.*;
import java.io.*;
import java.lang.*;
public class Codeforces{
    public static void main(String[] args){
		FastReader sc=new FastReader();
	    int n=sc.nextInt();
	    int k=sc.nextInt();
	    int[] arr=new int[n];
	    int maxi=-1;
	    int mini=1000;
	    for(int i=0;i<n;i++){
	        arr[i]=sc.nextInt();
	        maxi=Math.max(maxi,arr[i]);
	        mini=Math.min(mini,arr[i]);
	    }
	    if(maxi-mini-k<=0){
	        System.out.println("YES");
	        for(int i=0;i<n;i++){
	            int kk=1;
	            for(int j=0;j<arr[i];j++){
	                if(j<=mini){
	                    System.out.print(1+" ");
	                }
	                else{
	                    kk++;
	                    System.out.print(kk+" ");
	                }
	            }
	            System.out.println();
	        }
	    }
	    else{
	        System.out.println("NO");
	    }
	}
	
	static class pair{
	    int first;
	    int second;
	    public pair(int first, int second){
	        this.first=first;
	        this.second=second;
	    }
	}
	
	public static long pow(long a, long b){
		long res=1;
		while(b>0){
			if((b&1)!=0){
				res=(res * a);
			}
			a=a*a;
			b=b>>1;
		}
		return res;
	}
	
	public static String catoString(char[] ch){
		StringBuilder sb=new StringBuilder();
		for(int i=0;i<ch.length;i++){
			sb.append(ch[i]);
		}
		return sb.toString();
	}

	public static boolean isPrime(long n){
	    if(n<2) return false;
	    for(int i=2;i*i<=n;i++){
	    	if(n%i==0) return false;
	    } 
	    return true;
	}

	public static long gcd(long a, long b){
        if(b==0) return a;
        return gcd(b,a%b);
	}

	public static long lcm(long a, long b){
		long d=gcd(a,b);
		return (a*b)/d;
	}

	static class FastReader{
		BufferedReader br;
		StringTokenizer st;

		public FastReader(){
			br=new BufferedReader(new InputStreamReader(System.in));
		}

		String next(){
			while(st==null || !st.hasMoreElements()){
				try{
					st=new StringTokenizer(br.readLine());
				}
				catch(IOException e){
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

		int nextInt(){
			return Integer.parseInt(next());
		}

		long nextLong(){
			return Long.parseLong(next());
		}

		double nextDouble(){
			return Double.parseDouble(next());
		}

		String nextLine(){
			String str=" ";
			try{
               str=br.readLine();
			}
			catch(IOException e){
				e.printStackTrace();
			}
			return str;
		}
	}
}