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.io.*;
import java.util.*;

/**
 * Created by shamir0xe on 1/5/2015 AD.
 */

public class Solution {

    public static void main(String[] args) {
//        MyInput in;
//        try {
//            in = new MyInput(new FileInputStream(new File("input.txt")));
//        }
//        catch (IOException e) {
//            throw new UnknownError();
//        }
//        PrintWriter out;
//        try {
//            out = new PrintWriter(new FileOutputStream(new File("output.txt")));
//        }
//        catch (IOException e) {
//            throw new UnknownError();
//        }

        MyInput in = new MyInput(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int k = in.nextInt();
        int sizes[] = new int[n];
        int table[][] = new int[n][];
        int last[] = new int[n];
        for (int i = 0; i < n; i++) {
            sizes[i] = in.nextInt();
            table[i] = new int[sizes[i]];
        }
        Arrays.sort(sizes);
        int color = 1;
        for (int i = 0; i < n; i++) {
            int upTo = sizes[i];
            if (color == 1) {
                upTo++;
            }
            else {
                upTo = 1;
            }

            for (int pile = 0; pile < n; pile++) {
                int curLast = last[pile];
                for (int j = last[pile]; j < Math.min(table[pile].length, last[pile] + upTo); j++) {
                    table[pile][j] = color;
                    curLast = j;
                }
                last[pile] = Math.min(curLast + 1, table[pile].length);
            }
            color++;
        }

        for (int i = 0; i < n; i++) {
            int maxCol = 0;
            for (int j = 0; j < table[i].length; j++) {
                maxCol = Math.max(maxCol, table[i][j]);
            }
            for (int j = 0; j < table[i].length; j++) {
                if (table[i][j] == 0) {
                    maxCol++;
                    table[i][j] = maxCol;
                }
            }
        }

        int maxCol = 0;
        for (int i = 0; i < n; i++) {
            for (int j = 0; j < table[i].length; j++) {
                maxCol = Math.max(maxCol, table[i][j]);
            }
        }


        if (maxCol <= k) {
            out.println("YES");
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < table[i].length; j++) {
                    if (j != 0) {
                        out.print(" ");
                    }
                    out.print(table[i][j]);
                }
                out.println();
            }
        }
        else {
            out.println("NO");
        }

        out.flush();
        out.close();
    }

}

class MyInput {
    private BufferedReader br;
    private StringTokenizer st;

    MyInput (InputStream inputStream) {
        br = new BufferedReader(new InputStreamReader(inputStream));
        st = null;
    }

    public String next() {
        if (st == null || !st.hasMoreElements()) {
            try {
                String line = br.readLine();
                while (line == null || line.equals("")) {
                    throw new UnknownError();
                }
                st = new StringTokenizer(line);
            } catch (IOException e) {
                throw new UnknownError();
            }
        }
        return st.nextToken();
    }

    public String nextLine() {
        try {
            return br.readLine();
        }
        catch (IOException e) {
            throw new UnknownError();
        }
    }

    public void readEmptyLine() {
        try {
            br.readLine();
        }
        catch (IOException e) {
            throw new UnknownError();
        }
    }

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

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

}