Problem: You are given a chessboard consisting of n rows and n columns. Rows are numbered from bottom to top from 1 to n. Columns are numbered from left to right from 1 to n. The cell at the intersection of the x-th column and the y-th row is denoted as (x, y). Furthermore, the k-th column is a special column. 

Initially, the board is empty. There are m changes to the board. During the i-th change one pawn is added or removed from the board. The current board is good if we can move all pawns to the special column by the followings rules:

  * Pawn in the cell (x, y) can be moved to the cell (x, y + 1), (x - 1, y + 1) or (x + 1, y + 1); 
  * You can make as many such moves as you like; 
  * Pawns can not be moved outside the chessboard; 
  * Each cell can not contain more than one pawn. 



The current board may not always be good. To fix it, you can add new rows to the board. New rows are added at the top, i. e. they will have numbers n+1, n+2, n+3, ....

After each of m changes, print one integer — the minimum number of rows which you have to add to make the board good.

Input

The first line contains three integers n, k and m (1 ≤ n, m ≤ 2 ⋅ 10^5; 1 ≤ k ≤ n) — the size of the board, the index of the special column and the number of changes respectively.

Then m lines follow. The i-th line contains two integers x and y (1 ≤ x, y ≤ n) — the index of the column and the index of the row respectively. If there is no pawn in the cell (x, y), then you add a pawn to this cell, otherwise — you remove the pawn from this cell.

Output

After each change print one integer — the minimum number of rows which you have to add to make the board good.

Example

Input


5 3 5
4 4
3 5
2 4
3 4
3 5


Output


0
1
2
2
1

Solution (in CPP):

Solution:
#include <bits/stdc++.h>
using namespace std;
const int INTINF = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int MAXN = 1e5 + 10;
int n, k, q;
struct SegTree {
  struct Node {
    int l, r, mid, val, tag;
  };
  int n;
  vector<Node> tree;
  void init(int _n) {
    n = _n;
    tree.clear();
    tree.resize((n + 10) << 2);
  }
  void push_up(int u) {
    tree[u].val = max(tree[(u << 1)].val, tree[(u << 1 | 1)].val);
  }
  void build(int u, int l, int r, vector<int> &data) {
    tree[u] = Node{l, r, (l + r) >> 1, 0, 0};
    if (l == r)
      tree[u].val = data[l];
    else {
      build((u << 1), l, tree[u].mid, data);
      build((u << 1 | 1), tree[u].mid + 1, r, data);
      push_up(u);
    }
  }
  void build(vector<int> &data) { build(1, 1, n, data); }
  void update_node(int u, int d) {
    tree[u].val += d;
    tree[u].tag += d;
  }
  void push_down(int u) {
    update_node((u << 1), tree[u].tag);
    update_node((u << 1 | 1), tree[u].tag);
    tree[u].tag = 0;
  }
  void update(int l, int r, int d, int u = 1) {
    if (tree[u].l == l && tree[u].r == r)
      update_node(u, d);
    else {
      push_down(u);
      if (r <= tree[u].mid)
        update(l, r, d, (u << 1));
      else if (l > tree[u].mid)
        update(l, r, d, (u << 1 | 1));
      else {
        update(l, tree[u].mid, d, (u << 1));
        update(tree[u].mid + 1, r, d, (u << 1 | 1));
      }
      push_up(u);
    }
  }
  int query(int l, int r, int u = 1) {
    if (tree[u].l == l && tree[u].r == r)
      return tree[u].val;
    else {
      push_down(u);
      if (r <= tree[u].mid)
        return query(l, r, (u << 1));
      else if (l > tree[u].mid)
        return query(l, r, (u << 1 | 1));
      else
        return max(query(l, tree[u].mid, (u << 1)),
                   query(tree[u].mid + 1, r, (u << 1 | 1)));
    }
  }
};
int main() {
  scanf("%d%d%d", &n, &k, &q);
  SegTree tree;
  tree.init(n << 1);
  vector<int> data = {0};
  for (int i = 1; i <= n << 1; i++) data.push_back(i - 1);
  tree.build(data);
  set<pair<int, int> > apd;
  multiset<int> ocp;
  while (q--) {
    int x, y;
    scanf("%d%d", &x, &y);
    pair<int, int> cood = {x, y};
    int pos = y + abs(x - k);
    if (apd.find(cood) != apd.end()) {
      apd.erase(cood);
      ocp.erase(ocp.find(pos));
      tree.update(1, pos, -1);
    } else {
      apd.insert(cood);
      ocp.insert(pos);
      tree.update(1, pos, 1);
    }
    if (ocp.empty())
      puts("0");
    else
      printf("%d\n", max(0, tree.query(1, *ocp.rbegin()) - n));
  }
  return 0;
}