Problem: When you were a child you must have been told a puzzle of bags and coins. Anyway, here's one of its versions: 

A horse has three bags. The first bag has one coin, the second bag has one coin and the third bag has three coins. In total, the horse has three coins in the bags. How is that possible?

The answer is quite simple. The third bag contains a coin and two other bags. 

This problem is a generalization of the childhood puzzle. You have n bags. You know that the first bag contains a1 coins, the second bag contains a2 coins, ..., the n-th bag contains an coins. In total, there are s coins. Find the way to arrange the bags and coins so that they match the described scenario or else state that it is impossible to do.

Input

The first line contains two integers n and s (1 ≤ n, s ≤ 70000) — the number of bags and the total number of coins. The next line contains n integers a1, a2, ..., an (1 ≤ ai ≤ 70000), where ai shows the number of coins in the i-th bag.

Output

If the answer doesn't exist, print -1. 

Otherwise, print n lines, on the i-th line print the contents of the i-th bag. The first number in the line, ci (0 ≤ ci ≤ ai), must represent the number of coins lying directly in the i-th bag (the coins in the bags that are in the i-th bag are not taken into consideration). The second number in the line, ki (0 ≤ ki < n) must represent the number of bags that lie directly in the i-th bag (the bags that are inside the bags lying in the i-th bag are not taken into consideration). Next, the line must contain ki integers — the numbers of the bags that are lying directly in the i-th bag.

The total number of coins in the solution must equal s. If we count the total number of coins the i-th bag in the solution has, we should get ai. 

No bag can directly lie in more than one bag. The bags can be nested in more than one level (see the second test case). If there are multiple correct answers, you can print any of them.

Examples

Input

3 3
1 3 1


Output

1 0
1 2 3 1
1 0


Input

3 3
1 3 1


Output

1 0
2 1 3
0 1 1


Input

1 2
1


Output

-1


Input

8 10
2 7 3 4 1 3 1 2


Output

2 0
1 2 1 4
0 2 7 8
0 2 5 6
1 0
3 0
1 0
2 0

Note

The pictures below show two possible ways to solve one test case from the statement. The left picture corresponds to the first test case, the right picture corresponds to the second one.

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 77777;
unsigned int f[2][N], *cur, *nex;
pair<int, int> a[N];
int n, s, last[N], ans[N], belong[N], child[N];
map<unsigned int, int> mp;
void show() {
  while (last[s] != -1) {
    belong[last[s]] = 1;
    s -= a[last[s]].first;
  }
  for (int i = n - 1; i >= 0; i--) {
    ans[a[i].second] = a[i].first;
    if (!belong[i]) {
      ans[a[i + 1].second] -= a[i].first;
      child[a[i + 1].second] = a[i].second + 1;
    }
  }
  for (int i = 0; i < n; i++) {
    printf("%d ", ans[i]);
    if (child[i])
      printf("1 %d\n", child[i]);
    else
      printf("0\n");
  }
}
int main() {
  for (int i = 0; i < 32; i++) mp[1u << i] = i;
  scanf("%d%d", &n, &s);
  for (int i = 0; i < n; i++) {
    scanf("%d", &a[i].first);
    a[i].second = i;
  }
  sort(a, a + n);
  memset(last, -1, sizeof(last));
  if (a[n - 1].first > s) {
    puts("-1");
    return 0;
  }
  cur = f[0], nex = f[1];
  cur[a[n - 1].first >> 5] |= 1u << (a[n - 1].first & 31);
  last[a[n - 1].first] = n - 1;
  int nn = (s >> 5) + 1;
  for (int i = n - 2; i >= 0; i--) {
    int els = a[i].first >> 5;
    int shift = a[i].first & 31;
    for (int j = 0; j < nn; j++) {
      nex[j] |= cur[j];
      if (j + els < nn) nex[j + els] |= cur[j] << shift;
      if (j + els < nn - 1 && shift) nex[j + els + 1] |= cur[j] >> 32 - shift;
    }
    for (int j = 0; j < nn; j++) {
      long long New = cur[j] ^ nex[j];
      while (New) {
        last[j << 5 | mp[New & -New]] = i;
        New -= New & -New;
      }
    }
    swap(cur, nex);
  }
  if (last[s] == -1) {
    puts("-1");
    return 0;
  }
  show();
  return 0;
}