Problem: Vova decided to clean his room. The room can be represented as the coordinate axis OX. There are n piles of trash in the room, coordinate of the i-th pile is the integer p_i. All piles have different coordinates.

Let's define a total cleanup as the following process. The goal of this process is to collect all the piles in no more than two different x coordinates. To achieve this goal, Vova can do several (possibly, zero) moves. During one move, he can choose some x and move all piles from x to x+1 or x-1 using his broom. Note that he can't choose how many piles he will move.

Also, there are two types of queries:

  * 0 x — remove a pile of trash from the coordinate x. It is guaranteed that there is a pile in the coordinate x at this moment. 
  * 1 x — add a pile of trash to the coordinate x. It is guaranteed that there is no pile in the coordinate x at this moment. 



Note that it is possible that there are zero piles of trash in the room at some moment.

Vova wants to know the minimum number of moves he can spend if he wants to do a total cleanup before any queries. He also wants to know this number of moves after applying each query. Queries are applied in the given order. Note that the total cleanup doesn't actually happen and doesn't change the state of piles. It is only used to calculate the number of moves.

For better understanding, please read the Notes section below to see an explanation for the first example.

Input

The first line of the input contains two integers n and q (1 ≤ n, q ≤ 10^5) — the number of piles in the room before all queries and the number of queries, respectively.

The second line of the input contains n distinct integers p_1, p_2, ..., p_n (1 ≤ p_i ≤ 10^9), where p_i is the coordinate of the i-th pile.

The next q lines describe queries. The i-th query is described with two integers t_i and x_i (0 ≤ t_i ≤ 1; 1 ≤ x_i ≤ 10^9), where t_i is 0 if you need to remove a pile from the coordinate x_i and is 1 if you need to add a pile to the coordinate x_i. It is guaranteed that for t_i = 0 there is such pile in the current set of piles and for t_i = 1 there is no such pile in the current set of piles.

Output

Print q+1 integers: the minimum number of moves Vova needs to do a total cleanup before the first query and after each of q queries.

Examples

Input


5 6
1 2 6 8 10
1 4
1 9
0 6
0 10
1 100
1 50


Output


5
7
7
5
4
8
49


Input


5 8
5 1 2 4 3
0 1
0 2
0 3
0 4
0 5
1 1000000000
1 1
1 500000000


Output


3
2
1
0
0
0
0
0
499999999

Note

Consider the first example.

Initially, the set of piles is [1, 2, 6, 8, 10]. The answer before the first query is 5 because you can move all piles from 1 to 2 with one move, all piles from 10 to 8 with 2 moves and all piles from 6 to 8 with 2 moves.

After the first query, the set becomes [1, 2, 4, 6, 8, 10]. Then the answer is 7 because you can move all piles from 6 to 4 with 2 moves, all piles from 4 to 2 with 2 moves, all piles from 2 to 1 with 1 move and all piles from 10 to 8 with 2 moves.

After the second query, the set of piles becomes [1, 2, 4, 6, 8, 9, 10] and the answer is the same (and the previous sequence of moves can be applied to the current set of piles).

After the third query, the set of piles becomes [1, 2, 4, 8, 9, 10] and the answer is 5 because you can move all piles from 1 to 2 with 1 move, all piles from 2 to 4 with 2 moves, all piles from 10 to 9 with 1 move and all piles from 9 to 8 with 1 move.

After the fourth query, the set becomes [1, 2, 4, 8, 9] and the answer is almost the same (the previous sequence of moves can be applied without moving piles from 10).

After the fifth query, the set becomes [1, 2, 4, 8, 9, 100]. You can move all piles from 1 and further to 9 and keep 100 at its place. So the answer is 8.

After the sixth query, the set becomes [1, 2, 4, 8, 9, 50, 100]. The answer is 49 and can be obtained with almost the same sequence of moves as after the previous query. The only difference is that you need to move all piles from 50 to 9 too.

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5, INF = 0x3f3f3f3f;
struct Node {
  int mi, ma;
  int max;
} tr[N * 4];
int a[N], b[N];
bool st[N];
int op[N], q[N];
void pushup(int u) {
  tr[u].ma = max(tr[u << 1].ma, tr[u << 1 | 1].ma);
  if (tr[u << 1].mi == 0 || tr[u << 1 | 1].mi == 0)
    tr[u].mi = max(tr[u << 1].mi, tr[u << 1 | 1].mi);
  else
    tr[u].mi = min(tr[u << 1].mi, tr[u << 1 | 1].mi);
  if (tr[u << 1].ma == 0 || tr[u << 1 | 1].mi == 0)
    tr[u].max = max(tr[u << 1].max, tr[u << 1 | 1].max);
  else
    tr[u].max = max(max(tr[u << 1].max, tr[u << 1 | 1].max),
                    tr[u << 1 | 1].mi - tr[u << 1].ma);
}
void build(int u, int l, int r) {
  if (l == r) {
    if (st[l])
      tr[u] = {a[l], a[l], 0};
    else
      tr[u] = {0, 0, 0};
  } else {
    int mid = l + r >> 1;
    build(u << 1, l, mid), build(u << 1 | 1, mid + 1, r);
    pushup(u);
  }
}
void modify(int u, int l, int r, int x, bool op) {
  if (l == r) {
    if (op)
      tr[u] = {a[l], a[l], 0};
    else
      tr[u] = {0, 0, 0};
  } else {
    int mid = l + r >> 1;
    if (x <= mid)
      modify(u << 1, l, mid, x, op);
    else
      modify(u << 1 | 1, mid + 1, r, x, op);
    pushup(u);
  }
}
int query() { return tr[1].ma - tr[1].mi - tr[1].max; }
int main() {
  int n, Q;
  scanf("%d %d", &n, &Q);
  for (int i = 1; i <= n; i++) {
    scanf("%d", &a[i]);
    b[i] = a[i];
  }
  for (int i = 1; i <= Q; i++) {
    scanf("%d %d", &op[i], &q[i]);
    a[i + n] = q[i];
  }
  sort(b + 1, b + 1 + n);
  sort(a + 1, a + 1 + n + Q);
  int cnt = unique(a + 1, a + 1 + n + Q) - a - 1;
  for (int i = 1; i <= Q; i++) q[i] = lower_bound(a + 1, a + 1 + cnt, q[i]) - a;
  int k = 1;
  for (int i = 1; i <= n; i++) {
    while (b[i] != a[k]) k++;
    st[k] = true;
  }
  build(1, 1, cnt);
  printf("%d\n", query());
  for (int i = 1; i <= Q; i++) {
    modify(1, 1, cnt, q[i], op[i]);
    printf("%d\n", query());
  }
  return 0;
}