Codeforces Round #289 (Div. 2)-B. Painting Pebbles

原题链接

B. Painting Pebbles

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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

假设有一个堆具有最多鹅卵石n个，有k个颜色,若n > k 则1..k个鹅卵石具备1..k颜色，剩下的n-k个鹅卵石都具备1颜色那么这个堆具有m = n - k + 1个1颜色的鹅卵石,若n <= k则让每个鹅卵石染上不同颜色 m = 1

遍历剩下的鹅卵石，若石头的数量小于m那么显然输出NO,否则把m或m-1个鹅卵石染成1，剩下的染成不同的颜色

#include <bits/stdc++.h>
#define maxn 2005
#define MOD 1000000007
using namespace std;
typedef long long ll;

struct Node{
	int x, i;
}node[105];
vector<int> v[105];
bool cmp(const Node&a, const Node&b){
	return a.x > b.x;
}
int main(){
	
//	freopen("in.txt", "r", stdin);
	int n, k;
	
	scanf("%d%d", &n, &k);
	for(int i = 0; i < n; i++){
	 scanf("%d", &node[i].x);
	 node[i].i = i;
    }
    int h = 1;
    sort(node, node+n, cmp);
    for(int i = 0; i < n; i++){
    	if(i == 0){
    		if(node[i].x > k)
    		 h += node[i].x - k;
    	}
    	if(node[i].x < h-1){
    		puts("NO");
    		return 0;
    	}
    	int d = node[i].x > h - 1 ? h : h-1;
    	for(int j = 1; j <= d; j++)
    		v[node[i].i].push_back(1);
    	d = node[i].x - d;
    	for(int j = 2; j <= d+1; j++)
    	 v[node[i].i].push_back(j);
    }
    puts("YES");
    for(int i = 0; i < n; i++){
    	for(int j = 0; j < v[i].size(); j++){
    		if(j == 0)
    		 printf("%d", v[i][j]);
    		else
    		 printf(" %d", v[i][j]);
    	}
    	puts("");
    }
   return 0;
}