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
# fin = open("input.txt", "r")
# fout = open("output.txt", "w")

fin = sys.stdin
fout = sys.stdout

n, k = map(int, fin.readline().split())
nums = list(map(int, fin.readline().split()))
nums = sorted([(nums[i], i) for i in range(n)])
if nums[-1][0] - nums[0][0] > k:
	print("NO",file=fout)
else:
	print("YES", file=fout)
	ans = [[0 for i in range(k)] for j in range(n)]
	for pile in range(n):
		min_c = nums[pile][0] // k
		min_cnt = nums[pile][0] % k
		for i in range(min_cnt):
			ans[nums[pile][1]][i] = min_c + 1
		for i in range(min_cnt, k):
			ans[nums[pile][1]][i] = min_c
	# for row in ans:
	# 	print(*row)
	for pile in range(n):
		for color in range(k):
			for cnt in range(ans[pile][color]):
				print(color + 1, end = ' ', file=fout)
		print('', file=fout)
fout.close()