#include <bits/stdc++.h>
using namespace std;
constexpr int MAXN = 5e3 + 5;
constexpr int MAXX = 77780;
constexpr int MOD = 998244353;
constexpr long long INF = 1e15;
constexpr int LOG = 2000;
int n, k, v, a[MAXN], sum;
bool dp[MAXN][MAXN], base[MAXN][MAXN];
vector<int> vc, ans;
void Collect(int i, int j) {
  if (base[i][j]) {
    vc.push_back(i);
    return;
  }
  if (dp[i - 1][j]) {
    return Collect(i - 1, j);
  } else if (j < a[i] % k && dp[i - 1][j + k - a[i] % k]) {
    vc.push_back(i);
    return Collect(i - 1, j + k - a[i] % k);
  } else if (dp[i - 1][j - a[i] % k]) {
    vc.push_back(i);
    return Collect(i - 1, j - a[i] % k);
  }
  return;
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> k >> v;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
    sum += a[i];
  }
  if (v > sum) {
    cout << "NO\n";
    return 0;
  }
  if (v % k == 0) {
    for (int i = 1; i < n; i++) {
      if (a[i]) {
        ans.push_back((a[i] + k - 1) / k);
        ans.push_back(i);
        ans.push_back(n);
        a[n] += a[i];
        a[i] = 0;
      }
    }
    if (v > a[n] / k * k) {
      cout << "NO\n";
    } else {
      cout << "YES\n";
      for (int i = 0; i < ans.size(); i += 3) {
        cout << ans[i] << " " << ans[i + 1] << " " << ans[i + 2] << "\n";
      }
      if (v == 0) {
        return 0;
      }
      cout << v / k << " " << n << " 1";
      return 0;
    }
  }
  for (int i = 1; i <= n; i++) {
    dp[i][a[i] % k] = true;
    base[i][a[i] % k] = true;
  }
  for (int i = 2; i <= n; i++) {
    for (int j = 0; j < k; j++) {
      if (j < a[i] % k) {
        dp[i][j] = dp[i - 1][j] | dp[i - 1][k + j - a[i] % k] | dp[i][j];
      } else {
        dp[i][j] = dp[i - 1][j] | dp[i - 1][j - a[i] % k] | dp[i][j];
      }
    }
  }
  if (!dp[n][v % k]) {
    cout << "NO\n";
  } else {
    Collect(n, v % k);
    int idx = vc.back();
    vc.pop_back();
    for (auto i : vc) {
      int cnt = (a[i] + k - 1) / k;
      a[idx] += a[i];
      a[i] = 0;
      ans.push_back(cnt);
      ans.push_back(i);
      ans.push_back(idx);
    }
    if (a[idx] > v) {
      if (idx == 1) {
        int cnt = (a[idx] - v) / k;
        ans.push_back(cnt);
        ans.push_back(idx);
        ans.push_back(2);
      } else {
        int cnt = (a[idx] - v) / k;
        ans.push_back(cnt);
        ans.push_back(idx);
        ans.push_back(1);
      }
    } else if (a[idx] < v) {
      if (idx == n) {
        for (int i = 1; i < n - 1; i++) {
          if (a[i]) {
            ans.push_back((a[i] + k - 1) / k);
            ans.push_back(i);
            ans.push_back(n - 1);
            a[n - 1] += a[i];
            a[i] = 0;
          }
        }
        if (v > a[idx] + a[n - 1] / k * k) {
          cout << "NO\n";
          return 0;
        } else if (min(a[n - 1] / k * k, (v - a[idx]) / k) != 0) {
          ans.push_back(min(a[n - 1] / k * k, (v - a[idx]) / k));
          ans.push_back(n - 1);
          ans.push_back(idx);
        }
      } else {
        for (int i = 1; i < n; i++) {
          if (i == idx) {
            continue;
          }
          if (a[i]) {
            ans.push_back((a[i] + k - 1) / k);
            ans.push_back(i);
            ans.push_back(n);
            a[n] += a[i];
            a[i] = 0;
          }
        }
        if (v > a[idx] + a[n] / k * k) {
          cout << "NO\n";
          return 0;
        } else if (min(a[n] / k * k, (v - a[idx]) / k) != 0) {
          ans.push_back(min(a[n] / k * k, (v - a[idx]) / k));
          ans.push_back(n);
          ans.push_back(idx);
        }
      }
    }
    cout << "YES\n";
    for (int i = 0; i < ans.size(); i += 3) {
      cout << ans[i] << " " << ans[i + 1] << " " << ans[i + 2] << "\n";
    }
  }
  return 0;
}
