#include <bits/stdc++.h>
using namespace std;
int n, k, v;
bitset<5000 + 1> dp[5000 + 1];
short ant[5000 + 1][5000 + 1];
int a[5000 + 1];
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> v;
  int i;
  int sum = 0;
  for (i = 1; i <= n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  if (sum < v) {
    cout << "NO\n";
    return 0;
  }
  int r = v % k;
  if (r == 0) {
    cout << "YES\n";
    for (i = 1; i < n; i++) cout << 999999999 << " " << i << " " << n << "\n";
    if (v / k > 0)
      cout << v / k << " " << n << " "
           << "1"
           << "\n";
    return 0;
  }
  dp[0][0] = 1;
  int j;
  for (i = 1; i <= n; i++) {
    for (j = 0; j < k; j++) {
      if (dp[i - 1][j] == 1) {
        int r = (j + a[i]) % k;
        dp[i][j] = 1;
        dp[i][r] = 1;
        ant[i][j] = j;
        ant[i][r] = j;
      }
    }
  }
  if (dp[n][r] == 0) {
    cout << "NO\n";
    return 0;
  }
  cout << "YES\n";
  i = n;
  while (i >= 1 && dp[i - 1][r] == 1) i--;
  int bucket = i;
  int org = r;
  r = (k + r - (a[i] % k)) % k;
  while (a[bucket] % k != org) {
    while (i >= 1 && dp[i - 1][r] == 1) i--;
    cout << 999999999 << " " << i << " " << bucket << "\n";
    a[bucket] += a[i];
    r = (k + r - (a[i] % k)) % k;
    a[i] = 0;
  }
  int rest = 1;
  if (bucket == 1) rest = 2;
  int need = (v - a[bucket]) / k;
  for (i = 1; i <= n; i++) {
    if (i != bucket && i != rest && a[i] != 0)
      cout << 999999999 << " " << i << " " << rest << "\n";
  }
  if (need > 0) {
    cout << need << " " << rest << " " << bucket << "\n";
    a[bucket] += need;
  }
  if (a[bucket] > v)
    cout << (a[bucket] - v) / k << " " << bucket << " " << rest << "\n";
  return 0;
}
