func_code_string: #include <bits/stdc++.h>   using namespace std;   int main() {     int n, k;     cin >> n >> k;     int ar[n + 2], tr1[n + 2], tr2[n + 2], kl[k + 2][102];     memset(kl, 0, sizeof(kl));     vector<pair<int, int>> vec;     for (int i = 0; i < n; i++) {       cin >> ar[i];       tr1[i] = ar[i];       tr2[i] = ar[i];     }     sort(ar, ar + n);     sort(tr1, tr1 + n);     if (ar[n - 1] - ar[0] > k) {       cout <<  NO n ;       return 0;     }     cout <<  YES n ;     int mn = 101;     for (int i = 0; i < k; i++) {       int j = 0;       for (; j < n; j++) {         if (ar[j] > 0) {           mn = ar[j];           break;         }       }       for (; j < n; j++) {         if (i == 0) {           kl[i][j] = min(mn + 1, ar[j]);           ar[j] -= min(mn + 1, ar[j]);         } else {           kl[i][j] = 1;           ar[j] -= 1;         }       }     }     for (int i = 0; i < n; i++) {       int f = tr2[i];       int zz;       for (int z = 0; z < n; z++) {         if (tr1[z] == f) {           zz = z;           break;         }       }       for (int j = 0; j < k; j++) {         if (kl[j][zz] == 0) {           continue;         }         for (int l = 0; l < kl[j][zz]; l++) {           cout << j + 1 <<    ;         }       }       cout <<   n ;     }     return 0;   }   