Problem: Polycarp is an introvert person. In fact he is so much of an introvert that he plays "Monsters and Potions" board game alone. The board of the game is a row of n cells. The cells are numbered from 1 to n from left to right. There are three types of cells: a cell containing a single monster, a cell containing a single potion or a blank cell (it contains neither a monster nor a potion).

Polycarp has m tokens representing heroes fighting monsters, which are initially located in the blank cells s_1, s_2, ..., s_m. Polycarp's task is to choose a single cell (rally point) and one by one move all the heroes into this cell. A rally point can be a cell of any of three types.

After Policarp selects a rally point, he picks a hero and orders him to move directly to the point. Once that hero reaches the point, Polycarp picks another hero and orders him also to go to the point. And so forth, until all the heroes reach the rally point cell. While going to the point, a hero can not deviate from the direct route or take a step back. A hero just moves cell by cell in the direction of the point until he reaches it. It is possible that multiple heroes are simultaneously in the same cell.

Initially the i-th hero has h_i hit points (HP). Monsters also have HP, different monsters might have different HP. And potions also have HP, different potions might have different HP.

If a hero steps into a cell which is blank (i.e. doesn't contain a monster/potion), hero's HP does not change.

If a hero steps into a cell containing a monster, then the hero and the monster fight. If monster's HP is strictly higher than hero's HP, then the monster wins and Polycarp loses the whole game. If hero's HP is greater or equal to monster's HP, then the hero wins and monster's HP is subtracted from hero's HP. I.e. the hero survives if his HP drops to zero, but dies (and Polycarp looses) if his HP becomes negative due to a fight. If a hero wins a fight with a monster, then the monster disappears, and the cell becomes blank.

If a hero steps into a cell containing a potion, then the hero drinks the potion immediately. As a result, potion's HP is added to hero's HP, the potion disappears, and the cell becomes blank.

Obviously, Polycarp wants to win the game. It means that he must choose such rally point and the order in which heroes move, that every hero reaches the rally point and survives. I.e. Polycarp loses if a hero reaches rally point but is killed by a monster at the same time. Polycarp can use any of n cells as a rally point — initially it can contain a monster, a potion, or be a blank cell with or without a hero in it.

Help Polycarp write a program to choose a rally point and the order in which heroes move.

Input

The first line of the input contains two integers n and m (1 ≤ n ≤ 100; 1 ≤ m ≤ n) — length of the game board and the number of heroes on it.

The following m lines describe heroes. Each line contains two integers s_i and h_i (1 ≤ s_i ≤ n; 1 ≤ h_i ≤ 10^6), where s_i is the initial position and h_i is the initial HP of the i-th hero. It is guaranteed that each cell s_i is blank. It is also guaranteed that all s_i are different. 

The following line contains n integers a_1, a_2, ..., a_n (-10^6 ≤ a_j ≤ 10^6), where a_j describes the i-th cell of the game board:

  * a_j=0 means that the i-th cell is blank, 
  * a_j<0 means that the i-th cell contains monster with positive HP of -a_j, 
  * a_j>0 means that the i-th cell contains potion with a_j HP. 

Output

On the first line of the output print the index of the rally point cell.

On the second line print m integers — the order in which heroes should move to the rally point. Heroes are numbered from 1 to m in the order they are given in the input.

If there are multiple solutions, print any of them.

If it is impossible to find a rally point which can be reached by all heroes, print a single integer -1 in the output.

Examples

Input

8 3
8 2
1 3
4 9
0 3 -5 0 -5 -4 -1 0


Output

6
3 1 2 

Input

1 1
1 1
0


Output

1
1 

Input

3 2
1 1
3 1
0 -5000 0


Output

-1


Input

8 3
1 15
5 10
8 1
0 -5 -5 -5 0 -5 -5 0


Output

7
2 1 3 

Note

The picture illustrates the first example:

<image>

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int dell[8][2] = {{1, 2},  {1, -2},  {2, 1},  {2, -1},
                        {-1, 2}, {-1, -2}, {-2, 1}, {-2, -1}};
long long mod = 1e9 + 7;
const long long inf = (1LL << 31) - 1;
const int maxn = 2e5 + 7;
const int maxm = 1e6 + 7;
const double eps = 1e-8;
const double pi = acos(-1.0);
const int csize = 22;
int n, k, m, ar[maxn];
int p[maxn], s[maxn], h[maxn];
int le[maxn], ri[maxn];
int nex[maxn];
int ss[maxn];
pair<int, int> pp[maxn];
int main() {
  scanf("%d%d", &n, &m);
  memset(s, 0, sizeof(s));
  for (int i = 1; i <= m; i++) {
    scanf("%d%d", &s[i], &h[i]);
    pp[i] = make_pair(s[i], h[i]);
    ss[s[i]] = i;
  }
  sort(pp + 1, pp + m + 1);
  for (int i = 1; i <= m; i++) {
    s[i] = pp[i].first;
    h[i] = pp[i].second;
  }
  for (int i = 1; i <= n; i++) scanf("%d", &ar[i]);
  for (int i = 1; i <= m; i++) {
    int x = s[i], v = h[i];
    le[x] = ri[x] = x;
    for (int j = x - 1; j > 0; j--) {
      v += ar[j];
      if (v >= 0)
        le[x] = j;
      else
        break;
    }
    v = h[i];
    for (int j = x + 1; j <= n; j++) {
      v += ar[j];
      if (v >= 0)
        ri[x] = j;
      else
        break;
    }
  }
  int ans = 0, mid1 = 0, mid2 = 0;
  for (int i = 1; i <= n; i++) {
    if (s[1] > i) continue;
    if (s[m] < i) continue;
    bool fond = 1;
    mid1 = mid2 = 0;
    memset(nex, 0, sizeof(nex));
    int pre = s[1];
    for (int j = 2; j <= m; j++) {
      if (s[j] > i) break;
      if (ri[pre] < s[j]) {
        fond = 0;
        break;
      }
      if (ri[pre] > ri[s[j]]) {
        nex[s[j]] = nex[pre];
        nex[pre] = s[j];
      } else {
        nex[s[j]] = pre;
        pre = s[j];
      }
    }
    mid1 = pre;
    if (!fond) continue;
    if (s[m] == i && ri[mid1] >= i) {
      ans = i;
      break;
    }
    pre = s[m];
    for (int j = m - 1; j >= 1; j--) {
      if (s[j] <= i) break;
      if (le[pre] > s[j]) {
        fond = 0;
        break;
      }
      if (le[pre] < le[s[j]]) {
        nex[s[j]] = nex[pre];
        nex[pre] = s[j];
      } else {
        nex[s[j]] = pre;
        pre = s[j];
      }
    }
    mid2 = pre;
    if (fond && (ri[mid1] >= i && le[mid2] <= i + 1 ||
                 ri[mid1] >= i - 1 && le[mid2] <= i)) {
      ans = i;
      break;
    }
  }
  if (ans) {
    printf("%d\n", ans);
    int ins = 0;
    int now = mid1;
    if (ri[mid1] < ans) {
      now = mid2;
      while (now) {
        printf("%d%c", ss[now], ++ins == m ? '\n' : ' ');
        now = nex[now];
      }
      now = mid1;
      while (now) {
        printf("%d%c", ss[now], ++ins == m ? '\n' : ' ');
        now = nex[now];
      }
      return 0;
    }
    while (now) {
      printf("%d%c", ss[now], ++ins == m ? '\n' : ' ');
      now = nex[now];
    }
    now = mid2;
    while (now) {
      printf("%d%c", ss[now], ++ins == m ? '\n' : ' ');
      now = nex[now];
    }
  } else
    printf("-1\n");
  return 0;
}