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
#!/usr/bin/python

"""
Problem: http://codeforces.com/contest/509/problem/B
"""

def distribute_colors(stones_in_pile, colors_n):
    def next_color(color):
        return (color+1) % colors_n

    def pre_validate(stones_in_pile):
        for i in range(len(stones_in_pile)):
            for j in range(i, len(stones_in_pile)):
                if abs(stones_in_pile[i] - stones_in_pile[j]) > colors_n:
                    return False
        return True

    if not pre_validate(stones_in_pile):
        return None

    all_stones = sum(stones_in_pile)
    color = 0
    colored_stones = []
    uncolored_stones_per_pile = []
    for stones_num in stones_in_pile:
        colored_stones.append([])
        uncolored_stones_per_pile.append(stones_num)

    min_ai = min(stones_in_pile)

    # color up to min_ai stones in first color
    for i, pile in enumerate(stones_in_pile):
        to_paint = min(min_ai, pile)
        uncolored_stones_per_pile[i] -= to_paint
        colored_stones[i].extend([color for _ in range(to_paint)])
        all_stones -= to_paint
    while(all_stones):
        color = next_color(color)
        for i, pile in enumerate(stones_in_pile):
            to_paint = min(uncolored_stones_per_pile[i], 1)
            uncolored_stones_per_pile[i] -= to_paint
            colored_stones[i].extend([color for _ in range(to_paint)])
            all_stones -= to_paint
    return colored_stones

if __name__ == "__main__":
    piles_colors = raw_input()
    piles_n, colors_n = [int(i) for i in piles_colors.split(' ')]
    stones_in_pile = [int(i) for i in raw_input().split()]

    result = distribute_colors(stones_in_pile, colors_n)
    if not result:
        print "NO"
    else:
        print "YES"
        for line in result:
            print " ".join(str(x+1) for x in line)
