#include <bits/stdc++.h>
using namespace std;
const long long N = 5005;
long long n, K, v, a[N], sum;
bool dp[N][N];
vector<long long> x, y;
signed main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  cin >> n >> K >> v;
  for (long long i = 1; i <= n; ++i) cin >> a[i], sum += a[i];
  if (sum < v) {
    cout << "NO";
    return 0;
  }
  if (v % K == 0 && n > 1) {
    cout << "YES\n";
    for (long long i = 2; i <= n; ++i) cout << 100000 << " " << i << " 1\n";
    if (v) cout << v / K << ' ' << 1 << ' ' << n << '\n';
    return 0;
  }
  for (long long i = 1; i <= n; ++i) dp[i][a[i] % K] = 1;
  for (long long i = 1; i < n; ++i) {
    for (long long j = 0; j < K; ++j) {
      if (!dp[i][j]) continue;
      dp[i + 1][j] = dp[i][j];
      dp[i + 1][(j + a[i + 1]) % K] = dp[i][j];
    }
  }
  if (!dp[n][v % K]) {
    cout << "NO";
    return 0;
  } else {
    cout << "YES\n";
    long long pter = v % K;
    for (long long i = n; i; --i) {
      if (dp[i - 1][pter] == dp[i][pter])
        y.push_back(i);
      else {
        x.push_back(i);
        pter = ((pter - a[i]) % K + K) % K;
      }
    }
    sum = 0;
    for (long long i : x) {
      if (i != x.back()) cout << 100000 << " " << i << " " << x.back() << "\n";
      sum += a[i];
    }
    for (long long i : y) {
      if (i != y.back())
        cout << 100000 / K << " " << i << " " << y.back() << "\n";
    }
    if (sum > v) {
      cout << (sum - v) / K << " " << x.back() << " "
           << (y.size() ? y.back() : x[0]) << "\n";
    } else if (sum < v) {
      cout << (v - sum) / K << ' ' << y.back() << " " << x.back() << "\n";
    }
  }
  return 0;
}
