#include <bits/stdc++.h>
using namespace std;
const int maxn = 4e5 + 5;
int n, m, k, t[maxn << 2];
int lz[maxn << 2], cnt[maxn];
void build(int l, int r, int rt) {
  if (l == r) {
    t[rt] = l - 1;
    return;
  }
  int mid = l + r >> 1;
  build(l, mid, rt << 1);
  build(mid + 1, r, rt << 1 | 1);
  t[rt] = max(t[rt << 1], t[rt << 1 | 1]);
}
void pushdown(int rt) {
  if (lz[rt] != 0) {
    t[rt << 1] += lz[rt], t[rt << 1 | 1] += lz[rt];
    lz[rt << 1] += lz[rt], lz[rt << 1 | 1] += lz[rt];
    lz[rt] = 0;
  }
}
void update(int L, int R, int c, int l, int r, int rt) {
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    t[rt] += c, lz[rt] += c;
    return;
  }
  pushdown(rt);
  int mid = l + r >> 1;
  update(L, R, c, l, mid, rt << 1);
  update(L, R, c, mid + 1, r, rt << 1 | 1);
  t[rt] = max(t[rt << 1], t[rt << 1 | 1]);
}
int query(int L, int R, int l, int r, int rt) {
  if (l > R || r < L) return 0;
  if (l >= L && r <= R) return t[rt];
  pushdown(rt);
  int mid = l + r >> 1, ret = 0;
  ret = max(ret, query(L, R, l, mid, rt << 1));
  ret = max(ret, query(L, R, mid + 1, r, rt << 1 | 1));
  t[rt] = max(t[rt << 1], t[rt << 1 | 1]);
  return ret;
}
signed main() {
  scanf("%d%d%d", &n, &k, &m);
  build(1, n << 1, 1);
  set<pair<int, int> > p;
  set<int> mx;
  while (m--) {
    int x, y;
    scanf("%d%d", &y, &x);
    int pos = x + abs(y - k);
    if (p.count({x, y})) {
      cnt[pos]--;
      if (cnt[pos] == 0) mx.erase(pos);
      p.erase({x, y});
      update(1, pos, -1, 1, n << 1, 1);
    } else {
      cnt[pos]++;
      mx.insert(pos);
      p.insert({x, y});
      update(1, pos, 1, 1, n << 1, 1);
    }
    if (mx.empty())
      puts("0");
    else
      printf("%d\n", max(query(1, *mx.rbegin(), 1, n << 1, 1) - n, 0));
  }
}
