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 PYTHON3):

Solution:
import sys

n,k = map(int,input().split())
a = list(map(int,input().split()))

no = 0
p = x = min(a)
q = y = max(a)
#print(p,q)

small = [0]*k
big = [0]*k

p2 = p // k
p3 = p % k
#print(p2,p3)
for i in range(k):
    if x > 0:
        if p3 > 0:
            small[i] = p2 + 1
            p3 -= 1
        else:
            small[i] = p2
        x -= small[i]
    else:
        break
#print('small',small)

q2 = q // k
q3 = q % k
#print(q2,q3)
for i in range(k):
    if y > 0:
        if q3 > 0:
            big[i] = q2 + 1
            q3 -= 1
        else:
            big[i] = q2
        y -= big[i]
    else:
        break
#print('big',big)
for i in range(k):
    if abs(big[i] - small[i]) > 1:
        no = 1
        break
if no == 1:
    print('NO')
else:
    print('YES')
    for i in range(n):
        num = 1
        for j in range(a[i]):
            if num <= k:
                print(num,'',end='')
            else:
                num = 1
                print(num,'',end='')
            num += 1

        print('')