Problem: n children are standing in a circle and playing a game. Children's numbers in clockwise order form a permutation a1, a2, ..., an of length n. It is an integer sequence such that each integer from 1 to n appears exactly once in it.

The game consists of m steps. On each step the current leader with index i counts out ai people in clockwise order, starting from the next person. The last one to be pointed at by the leader becomes the new leader.

You are given numbers l1, l2, ..., lm — indices of leaders in the beginning of each step. Child with number l1 is the first leader in the game. 

Write a program which will restore a possible permutation a1, a2, ..., an. If there are multiple solutions then print any of them. If there is no solution then print -1.

Input

The first line contains two integer numbers n, m (1 ≤ n, m ≤ 100).

The second line contains m integer numbers l1, l2, ..., lm (1 ≤ li ≤ n) — indices of leaders in the beginning of each step.

Output

Print such permutation of n numbers a1, a2, ..., an that leaders in the game will be exactly l1, l2, ..., lm if all the rules are followed. If there are multiple solutions print any of them. 

If there is no permutation which satisfies all described conditions print -1.

Examples

Input

4 5
2 3 1 4 4


Output

3 1 2 4 


Input

3 3
3 1 2


Output

-1

Note

Let's follow leadership in the first example: 

  * Child 2 starts. 
  * Leadership goes from 2 to 2 + a2 = 3. 
  * Leadership goes from 3 to 3 + a3 = 5. As it's greater than 4, it's going in a circle to 1. 
  * Leadership goes from 1 to 1 + a1 = 4. 
  * Leadership goes from 4 to 4 + a4 = 8. Thus in circle it still remains at 4. 

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
int main() {
  int n, m, r, t;
  set<int> d;
  int l[110], a[110];
  bool can = true;
  cin >> n >> m;
  for (int k = 1; k <= m; k++) cin >> l[k];
  for (int k = 1; k <= n; k++) a[k] = 0;
  for (int k = 1; k < m; k++) {
    if (a[l[k]] == 0) {
      t = (k + 1) % m;
      if (t == 0) t = m;
      a[l[k]] = l[t] - l[k];
      while (a[l[k]] <= 0) a[l[k]] += n;
      if (d.find(a[l[k]]) != d.end()) {
        can = false;
        k = m + 1;
      } else
        d.insert(a[l[k]]);
    } else {
      t = (k + 1) % m;
      if (t == 0) t = m;
      r = l[t] - l[k];
      while (r <= 0) r += n;
      if (r != a[l[k]]) {
        can = false;
        k = m + 1;
      }
    }
  }
  for (int k = 1; k <= n; k++) {
    if (a[k] == 0 || a[k] > n) {
      for (int i = 1; i < 1000; i++) {
        if (d.find(i) == d.end()) {
          a[k] = i;
          d.insert(i);
          i = 1000;
        }
      }
    }
  }
  if (can) {
    for (int k = 1; k <= n; k++) cout << a[k] << " ";
  } else
    cout << -1 << endl;
  return 0;
}