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.BufferedWriter;
import java.io.IOException;
import java.io.InputStream;
import java.io.InputStreamReader;
import java.io.OutputStreamWriter;
import java.io.PrintWriter;
import java.util.Arrays;
import java.util.Scanner;
import java.util.StringTokenizer;







public class Main {
 
   
    
    static class Reader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public Reader(InputStream input) {
            reader = new BufferedReader(new InputStreamReader(input));
            tokenizer = new StringTokenizer("");
        }

        /** get next word */
        String nextToken() throws IOException {
            while ( ! tokenizer.hasMoreTokens() ) {
                //TODO add check for eof if necessary
                tokenizer = new StringTokenizer( reader.readLine() );
            }
            return tokenizer.nextToken();
        }

        String readLine() throws IOException {
            return reader.readLine();
        }

        char nextChar() throws IOException {
            return (char)reader.read();
        }

        int nextInt() throws IOException {
            return Integer.parseInt( nextToken() );
        }

        long nextLong() throws IOException {
            return Long.parseLong( nextToken() );
        }

        double nextDouble() throws IOException {
            return Double.parseDouble( nextToken() );
        }
    }
  
  
    
   
    public static void main(String[] args) throws IOException  {
      
        Reader sc=new Reader(System.in);
        int n=sc.nextInt();
        int k=sc.nextInt();
        int[] a=new int[n];
        int[][] num=new int[101][101];
        int[][] nu=new int[101][101];
        for (int i = 0; i < n; i++) {
            a[i]=sc.nextInt();
            int c=1;
            for (int j = 0; j < a[i]; j++) {
                num[i][j]=c;
                nu[i][c-1]++;
                c++;
                if(c==k+1)
                    c=1;
            }
        }
          
//         for (int i = 0; i < n; i++) {
//             for (int j = 0; j < a[i]; j++) {
//                 System.out.print(num[i][j]+",");
//             }
//             System.out.println("");
//        }
         int max=Integer.MIN_VALUE;
         int min=Integer.MAX_VALUE;
         boolean f=false;
         for (int i = 0; i < 100; i++) {
             for (int j = 0; j < n; j++) {
                if(nu[j][i]>max)max=nu[j][i];
                if(nu[j][i]<min)min=nu[j][i];
             }
          
             if(max-min>1)
             {f=true;
             break;
             }
             max=Integer.MIN_VALUE;
             min=Integer.MAX_VALUE;
           
        }
         
         if(f)
             System.out.println("NO");
         else
         {
              System.out.println("YES");
              for (int i = 0; i < n; i++) {
             for (int j = 0; j < a[i]-1; j++) {
                 System.out.print(num[i][j]+" ");
             }
              System.out.print(num[i][a[i]-1]);
             System.out.println("");
        }
             
             
         }
    
 
      
}
    

    
}

