Problem: Petya sometimes has to water his field. To water the field, Petya needs a tank with exactly V ml of water.

Petya has got N tanks, i-th of them initially containing ai ml of water. The tanks are really large, any of them can contain any amount of water (no matter how large this amount is).

Also Petya has got a scoop that can contain up to K ml of water (initially the scoop is empty). This scoop can be used to get some water from some tank, and after that pour it all into some tank (it is impossible to get water from multiple tanks without pouring it, or leave some water in the scoop when pouring it). When Petya tries to get some water from a tank, he gets min(v, K) water, where v is the current volume of water in the tank.

Is it possible to obtain a tank with exactly V ml of water using these operations? If it is possible, print a sequence of operations that allows to do it. If there are multiple ways to obtain needed amount of water in some tank, print any of them.

Input

The first line contains 3 integers: N (2 ≤ N ≤ 5000), K (1 ≤ K ≤ 5000), and V (0 ≤ V ≤ 109) — the number of tanks, the maximum volume of water the scoop can contain, and the required amount of water in some tank, respectively.

The second line contains N integers ai (0 ≤ ai ≤ 105), where ai is initial volume of water in i-th tank.

Output

If it is impossible to obtain a tank with exactly V ml of water, print NO. 

Otherwise print YES in the first line, and beginning from the second line, print the sequence of operations in the following format: 

Each line has to contain 3 numbers denoting a compressed operation: "cnt x y" (1 ≤ cnt ≤ 109, 1 ≤ x, y ≤ N), where x is the index of the tank where we get water, y is the index of the tank where we pour water, and cnt is the number of times we transfer water from tank x to tank y. 

The number of these lines must not exceed N + 5.

Examples

Input

2 3 5
2 3


Output

YES
1 2 1


Input

2 3 4
2 3


Output

NO


Input

5 2 0
1 3 5 7 9


Output

YES
2 2 1
3 3 1
4 4 1
5 5 1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAXN = 5010;
const int INF = 0x3f3f3f3f;
int n, k, v, A[MAXN], B[MAXN], dp[MAXN][MAXN];
bool T[MAXN][MAXN], S[MAXN];
void pour(int from, int to, int Q = 0) {
  if (!Q) Q = B[from] + 1;
  printf("%d %d %d\n", Q, from, to);
  B[to] += B[from];
  A[to] += A[from];
  B[from] = A[from] = 0;
  if (A[to] >= k) {
    A[to] -= k;
    B[to]++;
  }
}
int main() {
  scanf("%d%d%d", &n, &k, &v);
  int vs = 0;
  for (int i = 1; i <= n; ++i) {
    int x;
    scanf("%d", &x);
    vs += x;
    A[i] = x % k;
    B[i] = x / k;
  }
  int q = v / k;
  int m = v % k;
  memset(dp[0], INF, sizeof(dp[0]));
  dp[0][0] = 0;
  for (int i = 1; i <= n; ++i) {
    for (int j = 0; j < k; ++j) dp[i][j] = dp[i - 1][j];
    for (int j = 0; j < k; ++j) {
      if (j + A[i] >= k) {
        if (dp[i - 1][j] + 1 < dp[i][A[i] + j - k]) {
          dp[i][A[i] + j - k] = dp[i - 1][j] + 1;
          T[i][A[i] + j - k] = 1;
        }
      } else {
        if (dp[i - 1][j] + 1 < dp[i][A[i] + j]) {
          dp[i][A[i] + j] = dp[i - 1][j] + 1;
          T[i][A[i] + j] = 1;
        }
      }
    }
  }
  if (vs < v || dp[n][m] == INF) {
    puts("NO");
    return 0;
  }
  puts("YES");
  if (m == 0) {
    for (int i = 2; i <= n; ++i) {
      pour(i, 1);
    }
    if (q) printf("%d 1 2\n", q);
  } else {
    int cur = m;
    for (int i = n; i >= 1; --i) {
      if (T[i][cur]) {
        S[i] = 1;
        cur = (cur - A[i] + k) % k;
      }
    }
    if (S[1]) {
      for (int i = 2; i <= n; ++i)
        if (S[i]) pour(i, 1);
      for (int i = 3; i <= n; ++i)
        if (!S[i]) pour(i, 2);
      if (B[1]) pour(1, 2, B[1]);
      if (q) pour(2, 1, q);
    } else {
      for (int i = 2; i <= n; ++i)
        if (!S[i]) pour(i, 1);
      for (int i = 3; i <= n; ++i)
        if (S[i]) pour(i, 2);
      if (B[2]) pour(2, 1, B[2]);
      if (q) pour(1, 2, q);
    }
  }
}