#include <bits/stdc++.h>
using namespace std;
const int block_size = 320;
const long long mod = 1e9 + 7;
const long long inf = 1e9 + 7;
const long double eps = 1e-9;
const double PI = atan(1) * 4;
template <typename T>
inline int sign(const T &a) {
  if (a < 0) return -1;
  if (a > 0) return 1;
  return 0;
}
template <typename T, typename S>
inline bool upmin(T &a, const S &b) {
  return a > b ? a = b, 1 : 0;
}
template <typename T, typename S>
inline bool upmax(T &a, const S &b) {
  return a < b ? a = b, 1 : 0;
}
template <typename T>
inline void in(T &x) {
  x = 0;
  T f = 1;
  char ch = getchar();
  while (!isdigit(ch)) {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (isdigit(ch)) {
    x = x * 10 + ch - '0';
    ch = getchar();
  }
  x *= f;
}
long long twop(int x) { return 1LL << x; }
template <typename A, typename B>
inline void in(A &x, B &y) {
  in(x);
  in(y);
}
template <typename A, typename B, typename C>
inline void in(A &x, B &y, C &z) {
  in(x);
  in(y);
  in(z);
}
template <typename A, typename B, typename C, typename D>
inline void in(A &x, B &y, C &z, D &d) {
  in(x);
  in(y);
  in(z);
  in(d);
}
long long n, k, v;
long long vol[10000];
bool wan[10000];
bool ok[5010][5010], want[5010][5010];
void bye() {
  cout << "NO" << endl;
  exit(0);
}
int main() {
  cin >> n >> k >> v;
  for (long long i = 1; i < n + 1; i++) in(vol[i]);
  ok[0][0] = 1;
  for (long long i = 0; i < n; i++) {
    for (long long j = 0; j < 5010; j++) {
      if (ok[i][j]) {
        ok[i + 1][j] = 1;
        want[i + 1][j] = 0;
        ok[i + 1][(j + vol[i + 1]) % k] = 1;
        want[i + 1][(j + vol[i + 1]) % k] = 1;
      }
    }
  }
  long long sum = 0;
  for (long long i = 1; i < n + 1; i++) sum += vol[i];
  ;
  if (sum < v) bye();
  if (!ok[n][v % k]) {
    bye();
  }
  if (v % k == 0) {
    cout << "YES\n";
    for (long long i = 2; i < n + 1; i++) {
      printf("1000000000 %lld 1\n", i);
      vol[1] += vol[i];
      vol[i] = 0;
    }
    if (v / k) printf("%lld 1 2\n", v / k);
  } else {
    cout << "YES\n";
    long long cur = v % k;
    vector<long long> ele;
    for (long long i = n; i >= 1; i--) {
      if (want[i][cur]) {
        ele.push_back(i);
        cur -= vol[i] % k;
        if (cur < 0) cur += k;
      }
    }
    for (auto i : ele) wan[i] = 1;
    long long fin = ele.back(), oth;
    for (long long i = 1; i < n + 1; i++)
      if (i != fin) {
        oth = i;
        break;
      }
    for (long long i = 1; i < n + 1; i++) {
      if (wan[i]) {
        if (i != fin) {
          vol[fin] += vol[i];
          vol[i] = 0;
          printf("1000000000 %lld %lld\n", i, fin);
        }
      } else {
        if (i != oth) {
          vol[oth] += vol[i];
          vol[i] = 0;
          printf("1000000000 %lld %lld\n", i, oth);
        }
      }
    }
    if (vol[fin] > v) {
      printf("%lld %lld %lld\n", (vol[fin] - v) / k, fin, oth);
    } else if (vol[fin] < v) {
      printf("%lld %lld %lld\n", (v - vol[fin]) / k, oth, fin);
    }
  }
  return 0;
}
