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.util.Arrays;
import java.util.HashSet;
import java.util.LinkedList;

public class Main2 {

    public static void main(String[] args) throws Exception {

        BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
        String[] in = br.readLine().split(" ");
        int n = Integer.parseInt(in[0]);
        int k = Integer.parseInt(in[1]);
        in = br.readLine().split(" ");
        int[]arr = new int[n];
        int max = 0;
        for(int i = 0;i<n;i++){
            arr[i] = Integer.parseInt(in[i]);
            if(arr[i]>max)
                max = arr[i];
        }
        
//      if(k<n && n%k>1)
//          System.out.println("NO");
//      else{
            int[][]t = new int[n][Math.max(n, max)];
            int c = 1;

            for(int i = 0;i<Math.max(n, max);i++){
                for(int j = 0;j<n;j++){
                    if(c>k)
                        c = 1;
                    t[j][i] = c;
                }
                c++;
            }
            int spare = 1;
            for(int i = 0;i<n;i++){
                for(int j = 0;j<arr[i];j++){
                    if(t[i][j]>k){
                      spare = 10000000;
                    }
                }
            }
            if(spare>k){
                System.out.println("NO");
            }else{
                boolean flag = false;
                for(int i = 1;i<=k;i++){
                    int min = Integer.MAX_VALUE;
                    int maxi = 0;
                    boolean used = false;
                    for(int j = 0;j<n;j++){
                        int count = 0;
                        for(int l = 0;l<arr[j];l++){
                            
                            if(t[j][l]==i){
                                used = true;
                                count++;
                            }
                        }
                        if(min >count){
                            min = count;
                        }
                        if(maxi<count){
                            maxi = count;
                        }
                    }
                    if(used &&  maxi-min>1){
                        flag = true;
                        break;
                    }
                }
                
                if(!flag){
                    System.out.println("YES");

                    for(int i = 0;i<n;i++){
                        for(int j = 0;j<arr[i];j++){
                            System.out.print(t[i][j]+" ");
                        }
                        System.out.println();
                    }
                }else{
                    System.out.println("NO");
                }
            }
        }
        
    

}