Problem: Nastya likes reading and even spends whole days in a library sometimes. Today she found a chronicle of Byteland in the library, and it stated that there lived shamans long time ago. It is known that at every moment there was exactly one shaman in Byteland, and there were n shamans in total enumerated with integers from 1 to n in the order they lived. Also, each shaman had a magic power which can now be expressed as an integer.

The chronicle includes a list of powers of the n shamans. Also, some shamans can be king-shamans, if they gathered all the power of their predecessors, i.e. their power is exactly the sum of powers of all previous shamans. Nastya is interested in whether there was at least one king-shaman in Byteland.

Unfortunately many of the powers are unreadable in the list, so Nastya is doing the following:

  * Initially she supposes some power for each shaman. 
  * After that she changes the power of some shaman q times (the shamans can differ) and after that wants to check if there is at least one king-shaman in the list. If yes, she wants to know the index of any king-shaman. 



Unfortunately the list is too large and Nastya wants you to help her.

Input

The first line contains two integers n and q (1 ≤ n, q ≤ 2·105).

The second line contains n integers a1, ..., an (0 ≤ ai ≤ 109), where ai is the magic power of the i-th shaman.

After that q lines follow, the i-th of them contains two integers pi and xi (1 ≤ pi ≤ n, 0 ≤ xi ≤ 109) that mean that the new power of the pi-th shaman is xi.

Output

Print q lines, the i-th of them should contain  - 1, if after the i-th change there are no shaman-kings, and otherwise a single integer j, where j is an index of some king-shaman after the i-th change.

If there are multiple king-shamans after each change, print the index of any of them.

Examples

Input

2 1
1 3
1 2


Output

-1


Input

3 4
2 2 3
1 1
1 2
2 4
3 6


Output

3
2
-1
3


Input

10 7
0 3 1 4 6 2 7 8 10 1
2 5
1 3
9 36
4 10
4 9
1 2
1 0


Output

1
-1
9
-1
4
-1
1

Note

In the first example powers of shamans after the first change are equal to (2, 3). The answer equals  - 1, because the sum of powers of shamans before the first shaman is equal to 0, and before the second is equal to 2.

In the second example after the first change the powers are equal to (1, 2, 3). The answer is equal to 3, because the power of the third shaman is equal to 3, and the sum of powers of the first and the second shaman is also 1 + 2 = 3. After the second change the powers become equal to (2, 2, 3), where the answer equals 2. After the third change the powers become equal to (2, 4, 3), where the answer equals  - 1. After the fourth change the powers become equal to (2, 4, 6), where the answer equals 3.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 2e5 + 5, NOT_FOUND = -1;
long long max_tree[4 * MAX_N], sum_tree[4 * MAX_N], A[MAX_N];
int no_of_elements;
void build(int n, int left, int right) {
  if (left == right) {
    max_tree[n] = sum_tree[n] = A[left];
    return;
  }
  int mid = (left + right) >> 1;
  build((2 * n), left, mid);
  build((2 * n + 1), mid + 1, right);
  sum_tree[n] = sum_tree[(2 * n)] + sum_tree[(2 * n + 1)];
  max_tree[n] = max(max_tree[(2 * n)], max_tree[(2 * n + 1)]);
}
void update(int n, int left, int right, int index, int new_value) {
  if (right < index || index < left) return;
  if (left == right) {
    A[index] = new_value;
    sum_tree[n] = max_tree[n] = new_value;
    return;
  }
  int mid = (left + right) >> 1;
  update((2 * n), left, mid, index, new_value);
  update((2 * n + 1), mid + 1, right, index, new_value);
  sum_tree[n] = sum_tree[(2 * n)] + sum_tree[(2 * n + 1)];
  max_tree[n] = max(max_tree[(2 * n)], max_tree[(2 * n + 1)]);
}
long long get_sum(int n, int left, int right, int query_left, int query_right) {
  if (query_right < left || right < query_left) return 0;
  if (query_left <= left && right <= query_right) return sum_tree[n];
  int mid = (left + right) >> 1;
  long long left_sum = get_sum((2 * n), left, mid, query_left, query_right);
  long long right_sum =
      get_sum((2 * n + 1), mid + 1, right, query_left, query_right);
  return (left_sum + right_sum);
}
int first_index(int n, int left, int right, int query_left, int query_right,
                long long minimum) {
  if (right < query_left || query_right < left || max_tree[n] < minimum)
    return NOT_FOUND;
  if (left == right) return left;
  int mid = (left + right) >> 1;
  int left_answer =
      first_index((2 * n), left, mid, query_left, query_right, minimum);
  if (left_answer != NOT_FOUND) return left_answer;
  int right_answer = first_index((2 * n + 1), mid + 1, right, query_left,
                                 query_right, minimum);
  return right_answer;
}
int get_answer() {
  int index = 1;
  while (index != NOT_FOUND) {
    long long prefix_sum = get_sum(1, 1, no_of_elements, 1, index - 1);
    if (prefix_sum == A[index]) return index;
    prefix_sum = get_sum(1, 1, no_of_elements, 1, index);
    index = first_index(1, 1, no_of_elements, index + 1, no_of_elements,
                        prefix_sum);
  }
  return index;
}
void solve() {
  int index, new_value;
  scanf("%d %d", &index, &new_value);
  update(1, 1, no_of_elements, index, new_value);
  int answer = get_answer();
  printf("%d\n", answer);
}
int main() {
  int no_of_queries;
  scanf("%d %d", &no_of_elements, &no_of_queries);
  for (int i = 1; i <= no_of_elements; i++) scanf("%I64d", &A[i]);
  build(1, 1, no_of_elements);
  while (no_of_queries--) solve();
  return 0;
}