#include <bits/stdc++.h>
using namespace std;
int n, m, k;
int t[(int)(1e6 + 10) << 2], lz[(int)(1e6 + 10) << 2], cnt[(int)(1e6 + 10)];
void build(int l, int r, int x) {
  if (l == r) {
    t[x] = l - 1;
    return;
  }
  int mid = l + r >> 1;
  build(l, mid, x << 1);
  build(mid + 1, r, x << 1 | 1);
  t[x] = max(t[x << 1], t[x << 1 | 1]);
}
void pushdown(int x) {
  if (lz[x] != 0) {
    t[x << 1] += lz[x], t[x << 1 | 1] += lz[x];
    lz[x << 1] += lz[x], lz[x << 1 | 1] += lz[x];
    lz[x] = 0;
    return;
  }
}
void update(int L, int R, int l, int r, int x, int c) {
  if (l > R || r < L) return;
  if (l >= L && r <= R) {
    t[x] += c, lz[x] += c;
    return;
  }
  pushdown(x);
  int mid = l + r >> 1;
  update(L, R, l, mid, x << 1, c);
  update(L, R, mid + 1, r, x << 1 | 1, c);
  t[x] = max(t[x << 1], t[x << 1 | 1]);
}
int query(int L, int R, int l, int r, int x) {
  if (l > R || r < L) return 0;
  if (l >= L && r <= R) return t[x];
  pushdown(x);
  int mid = l + r >> 1;
  int res = 0;
  res = max(res, query(L, R, l, mid, x << 1));
  res = max(res, query(L, R, mid + 1, r, x << 1 | 1));
  t[x] = max(t[x << 1], t[x << 1 | 1]);
  return res;
}
int ans[(int)(1e6 + 10)];
int main() {
  ios::sync_with_stdio(0);
  cin >> n >> k >> m;
  build(1, n << 1, 1);
  set<pair<int, int> > p;
  set<int> mx;
  for (int cas = 1; cas <= m; cas++) {
    int x, y;
    cin >> 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, n << 1, 1, -1);
    } else {
      cnt[pos]++;
      mx.insert(pos);
      p.insert({x, y});
      update(1, pos, 1, n << 1, 1, 1);
    }
    if (mx.empty())
      ans[cas] = 0;
    else
      ans[cas] = max(query(1, *mx.rbegin(), 1, n << 1, 1) - n, 0);
  }
  for (int i = 1; i <= m; i++) cout << ans[i] << endl;
}
