Problem: Polycarp loves not only to take pictures, but also to show his photos to friends. On his personal website he has recently installed a widget that can display n photos with the scroll option. At each moment of time the widget displays exactly one photograph with the option showing the previous/next one. From the first photo, you can switch to the second one or to the n-th one, from the second photo you can switch to the third one or to the first one, etc. Thus, navigation is performed in a cycle.

Polycarp's collection consists of m photo albums, the i-th album contains ai photos. Polycarp wants to choose n photos and put them on a new widget. To make watching the photos interesting to the visitors, he is going to post pictures so that no two photos from one album were neighboring (each photo will have exactly two neighbors, the first photo's neighbors are the second and the n-th one).

Help Polycarp compile a photo gallery. Select n photos from his collection and put them in such order that no two photos from one album went one after the other.

Input

The first line contains two integers n and m (3 ≤ n ≤ 1000, 1 ≤ m ≤ 40), where n is the number of photos on the widget, and m is the number of albums. The second line contains m integers a1, a2, ..., am (1 ≤ ai ≤ 1000), where ai is the number of photos in the i-th album.

Output

Print the single number -1 if there is no solution. Otherwise, print n numbers t1, t2, ..., tn, where ti represents the number of the album of the i-th picture in the widget. The albums are numbered from 1 in the order of their appearance in the input. If there are several solutions, print any of them.

Examples

Input

4 3
1 3 5


Output

3 1 3 2


Input

10 2
5 5


Output

2 1 2 1 2 1 2 1 2 1


Input

10 3
1 10 3


Output

-1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int n, m;
int a[40];
int res[1000];
int main() {
  scanf("%d%d", &n, &m);
  priority_queue<pair<int, int> > q;
  for (int i = 0; i < m; ++i) {
    scanf("%d", &a[i]);
    q.push(make_pair(a[i], i + 1));
  }
  bool succ = true;
  vector<int> res;
  for (int i = 0; i < n; i += 2) {
    if (q.empty()) {
      succ = false;
      break;
    }
    pair<int, int> p1 = q.top();
    q.pop();
    res.push_back(p1.second);
    if (i + 1 < n) {
      if (q.empty()) {
        succ = false;
        break;
      }
      pair<int, int> p2 = q.top();
      q.pop();
      res.push_back(p2.second);
      if (--p2.first != 0) {
        q.push(p2);
      }
    }
    if (--p1.first != 0) {
      q.push(p1);
    }
  }
  if (succ && res[0] == res.back()) {
    if (res[n - 1] != res[n - 3]) {
      swap(res[n - 2], res[n - 1]);
    } else {
      while (!q.empty() && (res[0] == res.back() || res[n - 1] == res[n - 2])) {
        res.back() = q.top().second;
        q.pop();
      }
      succ = res[0] != res.back();
    }
  }
  if (succ) {
    for (int i = 0; i < n; ++i) {
      printf("%d%c", res[i], i + 1 == n ? '\n' : ' ');
    }
  } else {
    puts("-1");
  }
  return 0;
}