#include <bits/stdc++.h>
using namespace std;
long long int gcd(long long int a, long long int b) {
  if (a == 0) return b;
  return gcd(b % a, a);
}
int main() {
  long long int t, b, m, n, i, j, temp, mm, mx, hell, l, r, k, ans, c, p, q,
      val, count, total, sum;
  long long int a[100001];
  vector<long long int> v[103];
  string s;
  cin >> n >> k;
  for (i = 0; i < n; i++) cin >> a[i];
  for (i = 0; i < n; i++) {
    temp = 1;
    for (j = 0; j < a[i]; j++) {
      v[i].push_back(temp);
      temp++;
      if (temp > k) temp = temp - k;
    }
  }
  mm = 1000000000;
  mx = 0;
  int f = 0;
  for (p = 1; p <= k; p++) {
    mm = 1000000000;
    mx = 0;
    for (i = 0; i < n; i++) {
      if (a[i] % k >= p)
        val = a[i] / k + 1;
      else
        val = a[i] / k;
      mm = min(mm, val);
      mx = max(mx, val);
    }
    if ((mx - mm) > 1) f = 1;
  }
  if (f == 1)
    cout << "NO" << endl;
  else {
    cout << "YES" << endl;
    for (i = 0; i < n; i++) {
      for (j = 0; j < v[i].size(); j++) cout << v[i][j] << " ";
      cout << endl;
    }
  }
  return 0;
}
