Snuke participated in a magic show.

A magician prepared N identical-looking boxes. He put a treasure in one of the boxes, closed the boxes, shuffled them, and numbered them 1 through N.

Since the boxes are shuffled, now Snuke has no idea which box contains the treasure. Snuke wins the game if he opens a box containing the treasure. You may think that if Snuke opens all boxes at once, he can always win the game. However, there are some tricks:

* Snuke must open the boxes one by one. After he opens a box and checks the content of the box, he must close the box before opening the next box.
* He is only allowed to open Box i at most a_i times.
* The magician may secretly move the treasure from a closed box to another closed box, using some magic trick. For simplicity, assume that the magician never moves the treasure while Snuke is opening some box. However, he can move it at any other time (before Snuke opens the first box, or between he closes some box and opens the next box).
* The magician can perform the magic trick at most K times.



Can Snuke always win the game, regardless of the initial position of the treasure and the movements of the magician?

Constraints

* 2 \leq N \leq 50
* 1 \leq K \leq 50
* 1 \leq a_i \leq 100

Input

Input is given from Standard Input in the following format:


N K
a_1 a_2 \cdots a_N


Output

If the answer is no, print a single `-1`.

Otherwise, print one possible move of Snuke in the following format:


Q
x_1 x_2 \cdots x_Q


It means that he opens boxes x_1, x_2, \cdots, x_Q in this order.

In case there are multiple possible solutions, you can output any.

Examples

Input

2 1
5 5


Output

7
1 1 2 1 2 2 1


Input

3 50
5 10 15


Output

-1
#include <bits/stdc++.h>
using namespace std;
typedef long long LL;

int main(){
	int n, k;
	cin >> n >> k;
	vector<int> a(n);
	for(int i = 0; i < n; i++){
		cin >> a[i];
	}
	k++;
	// should get all numbers to at least k+1;

	int asum = 0;
	int amax = 0;
	for(int i = 0; i < n; i++){
		a[i] = k - a[i];
		if(a[i] < 0) a[i] = 0;
		asum += a[i];
		amax = max(amax, a[i]);
	}
	if(asum > k-1 || amax > (k - amax) ){
		cout << -1 << '\n';
		return 0;
	}
	vector<set<int> > f(k);
	vector<int> bb(k-1);
	for(int i = 0; i < k; i++){
		for(int j = 0; j < n; j++){
			f[i].insert(j);
		}
	}
	int last_val = -1;
	for(int s = 0; s < k-1; s++){
		int best = (last_val + 1) % n;
		for(int i = 0; i < n; i++){
			if(i == last_val) continue;
			if(a[i] > a[best]){
				best = i;
			}
		}
		last_val = best;
		bb[s] = best;
		f[s].erase(best);
		f[s+1].erase(best);
		a[best]--;
	}

	vector<int> ans;
	for(int i = 0; i < k; i++){
		if(i > 0) ans.push_back(bb[i-1]);
		for(int x : f[i]){
			ans.push_back(x);
		}
	}
	cout << int(ans.size()) << '\n';
	for(int x : ans){
		cout << x + 1 << ' ';
	}
	cout << '\n';
}