Problem: 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

Solution (in JAVA):

Solution:
import java.util.*;
import java.io.*;

public class Main {
    static int sol[][];
    static int A[];
    static int n,k;

    public static void main(String[] args) throws FileNotFoundException {
        //System.setIn(new FileInputStream("test.txt"));
        Scanner sc = new Scanner(System.in);
       
        n = sc.nextInt();
        k = sc.nextInt();
        sol = new int[n+5][k+5];
        A = new int[n+5];
        
        for (int i = 0; i < n; i++) {
            A[i] = sc.nextInt();
        }
        
        for (int i = 0; i < k; i++) {
            int maxi = 1001001001;
            for (int j = 0; j < n; j++) maxi = Math.min(maxi, A[j]);
            
            for (int j = 0; j < n; j++) {
                int temp = Math.min(A[j], maxi+1);
                sol[j][i] = temp; 
                A[j] -= temp;
            }
        }
        
        boolean done = true;
      
        
        for (int i = 0; i < n; i++) {
            //for (int j = 0; j < k; j++) System.out.print(sol[i][j] + " ");
            
            //System.out.println();
            done &= (A[i] == 0);
        }
        
        
        if (done) {
            System.out.println("YES");
            for (int i = 0; i < n; i++) {
                boolean s = false;
                for (int j = 0; j < k; j++) {
                    while (sol[i][j]-- > 0) {
                        if (s) System.out.print(" ");
                        else s = true;
                        System.out.print(j+1);
                    }
                }
                System.out.print("\n");
            }
        } else {
            System.out.println("NO");
        }
        
    }
    
}