#include <bits/stdc++.h>
using namespace std;
int main() {
  ios_base::sync_with_stdio();
  cin.tie(0);
  cout.tie(0);
  long long int N, M, K;
  cin >> N >> M >> K;
  long long int a[M], b[M];
  for (long long int i = 0; i < M; i++) {
    cin >> a[i];
  }
  for (int i = 0; i < M; i++) {
    if (i == 0) {
      b[i] = a[i];
    } else {
      b[i] = b[i - 1] + a[i];
    }
  }
  long long int i = -1, j = -1;
  vector<long long int> ans;
  while (i < N) {
    long long int new_pos = i + K;
    if (j >= M - 1) {
      if (new_pos < N) {
        cout << "NO" << endl;
        return 0;
      } else
        break;
    }
    if (b[M - 1] - (j >= 0 ? b[j] : 0) <= N - new_pos) {
      i = new_pos;
      ans.push_back(i);
      j++;
      i += a[j] - 1;
    } else {
      while (b[M - 1] - (j >= 0 ? b[j] : 0) > N - new_pos) {
        new_pos--;
      }
      if (new_pos < i) {
        cout << "NO" << endl;
        return 0;
      } else {
        i = new_pos;
        ans.push_back(i);
        j++;
        i += a[j] - 1;
      }
    }
  }
  int a2[N];
  memset(a2, 0, sizeof a2);
  cout << "Yes" << endl;
  for (long long int i = 0; i < ans.size(); i++) {
    int t4 = ans[i];
    for (int k = t4; k < t4 + a[i]; k++) a2[k] = i + 1;
  }
  for (int i = 0; i < N; i++) {
    cout << a2[i] << " ";
  }
  return 0;
}
