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
class CodeforcesTask509BSolution:
    def __init__(self):
        self.result = ''
        self.n_k = []
        self.piles = []

    def read_input(self):
        self.n_k = [int(x) for x in input().split(" ")]
        self.piles = [int(x) for x in input().split(" ")]

    def process_task(self):
        mx_dist = max(self.piles) - min(self.piles)
        if mx_dist > self.n_k[1]:
            self.result = "NO"
        else:
            pile_order = " ".join([str(x + 1) for x in range(self.n_k[1])])
            results = []
            for pile in self.piles:
                pl = []
                pl += [pile_order for x in  range(pile // self.n_k[1])]
                pl.append(" ".join([str(x + 1) for x in range(self.n_k[1])][:(pile % self.n_k[1])]))
                results.append(" ".join(pl))
                if results[-1][0] == " ":
                    results[-1] = results[-1][1:]
            self.result = "YES\n{0}".format("\n".join(results))

    def get_result(self):
        return self.result


if __name__ == "__main__":
    Solution = CodeforcesTask509BSolution()
    Solution.read_input()
    Solution.process_task()
    print(Solution.get_result())
