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.IOException;
import java.io.InputStreamReader;
import java.math.BigInteger;
import java.util.*;
 
public class Minimise {
    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;
        }
    }
     public static boolean areAnagram(String s1,String s2){
           if(s1.length() != s2.length())
           {
               return false;
           }
           int count [] = new int[26];
           for (int i=0;i<s1.length();i++)
           {
               count[s1.charAt(i)-'a']++;
               count[s2.charAt(i)-'a']--;
           }
           for(int i=0;i<26;i++)
           {
               if(count[i]!=0)
               {
                   return false;
               }
           }
           return true;
  }

  public static boolean aresubsequence(String s1,String s2){
   int i=0;
   int j=0;
   while(i<s1.length() && j<s2.length())
   {
       if(s2.charAt(j) == s1.charAt(i) )
       {
           j++;
       }
       i++;
   }
    if(j!=s2.length())
    {
        return false;
    }else
    {
        return true;
    }

    

  }
  public static boolean needBoth(String s1,String s2)
  {
      int count[] =new int[26];
      for(int i=0;i<s2.length();i++)
      {
          count[s2.charAt(i)-'a']++;
      }
      for(int i=0;i<s1.length();i++)
      {
          count[s1.charAt(i)-'a']--;
      }
      for(int i=0;i<26;i++)
      {
          if(count[i]==1)
          {
              return false;
          }
      }
      return true;
  }
	public static void main (String[] args) throws java.lang.Exception
	{
		// your code goes here
	
		FastReader sc = new FastReader();
    int n = sc.nextInt();
    int m =sc.nextInt();
    int t=1;
    int require=0;
    int []arr=new int [n];
    int min=Integer.MAX_VALUE; 
    int max= 0;
    for(int i=0;i<n;i++)
    {
        arr[i]=sc.nextInt();
        min=Math.min(arr[i],min);
        max=Math.max(arr[i],max);
    }
    if(max-min >m)
    {
        System.out.println("NO");
    }else
    {System.out.println("YES");
      for(int i=0;i<n;i++)
      {
          for(int j=0;j<min;j++)
          {
              System.out.print(1+" ");
          }
          for(int j=1;j<=arr[i]-min;j++)
          {
              System.out.print(j+" ");
          }System.out.println();
      }
      
    }}}
   