#include <bits/stdc++.h>

#if defined(LOCAL)
#define DBG_MACRO_NO_WARNING
#include <dbg.hpp>
#else
#define dbg(x...) (0)
#endif

using namespace std;

using ll = long long;

// #define int ll
#define rep(i, f, t) for (int i = (f), ed##i = (t); i <= ed##i; ++i)
#define re(i, t) rep (i, 1, t)
#define per(i, t, f) for (int i = (t), ed##i = (f); i >= ed##i; --i)
#define ste(i, f, t, s) for (int i = (f), ed##i = (t); i <= ed##i; i += s)
#define nxt(i, f, g) for (int i = g.h[f]; i; i = g.e[i].n)
#define umod(x) ((x) >= mo && ((x) -= mo))
#define dmod(x) ((x) < 0 && ((x) += mo))
#define y1 y1__
#define fio(x) (freopen(x ".in", "r", stdin), freopen(x ".out", "w", stdout))
#define lb(x) ((x) & -(x))

template <class T, class E>
__attribute__((always_inline)) inline void up(T &x, E &&y) {
  if (x < y) x = y;
}
template <class T, class E>
__attribute__((always_inline)) inline void down(T &x, E &&y) {
  if (y < x) x = y;
}

const int N = 1e6 + 9;
int n, m, pos[N];

struct Seg {
  struct T {
    int sum, mn, zcnt, fcnt;
  } d[N << 2];

  static T Mer(T x, T y) {
    T res;
    res.sum = x.sum + y.sum;
    res.mn = min(x.mn, x.sum + y.mn);
    res.zcnt = x.zcnt + y.zcnt;
    res.fcnt = x.fcnt + y.fcnt;
    return res;
  }

  inline void Up(int u) { d[u] = Mer(d[u << 1], d[u << 1 | 1]); }

  inline void Cha(int p, int x, int u, int l, int r) {
    if (l == r) {
      if (x == 1)
        d[u].zcnt = 1, d[u].fcnt = 0;
      else if (x == -1)
        d[u].fcnt = 1, d[u].zcnt = 0;
      else
        d[u].zcnt = d[u].fcnt = 0;
      d[u].sum = d[u].mn = x;
      return;
    }
    int mid = (l + r) >> 1;
    if (p <= mid)
      Cha(p, x, u << 1, l, mid);
    else
      Cha(p, x, u << 1 | 1, mid + 1, r);
    Up(u);
  }

  inline T Ask(int L, int R, int u, int l, int r) {
    if (L <= l && r <= R) return d[u];
    int mid = (l + r) >> 1;
    if (R <= mid) return Ask(L, R, u << 1, l, mid);
    if (mid + 1 <= L) return Ask(L, R, u << 1 | 1, mid + 1, r);
    return Mer(Ask(L, R, u << 1, l, mid), Ask(L, R, u << 1 | 1, mid + 1, r));
  }
} seg;

inline bool Add(int id) {
  if (seg.d[1].sum <= 0) return 0;
  seg.Cha(n + id, -1, 1, 1, n + m);
  return 1;
}

inline bool Ck1(int l, int r) {
  auto res1 = seg.Ask(l, r, 1, 1, n + m);
  return res1.fcnt;
}

inline int ErFen1(int L, int r) {
  if (!Ck1(L, r)) return -1;
  int l = L;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (Ck1(L, mid))
      r = mid;
    else
      l = mid + 1;
  }
  int res = Ck1(L, l) ? l : r;
  return res;
}

inline bool Test(int id, int x, int y) {
  if (!y) {
    auto res1 = pos[x] == 1 ? Seg::T{0, 0, 0, 0} : seg.Ask(1, pos[x] - 1, 1, 1, n + m);
    int res2 = seg.Ask(pos[x] + 1, n + m, 1, 1, n + m).mn;
    int res = min(res1.mn, res1.sum + res2);
    if (res < 0) return 0;
  } else {
    auto add = ErFen1(pos[x], n + id - 1);
    // dbg(add);
    if (add == -1) return 0;
    seg.Cha(add, 0, 1, 1, n + m);
  }
  seg.Cha(pos[x], 0, 1, 1, n + m);
  seg.Cha(n + id, 1, 1, 1, n + m);
  pos[x] = n + id;
  return 1;
}

// 查询 [1,x]~[1,r] 是否存在一个 sum=0 的
inline bool Ck2(int x, int r) {
  int res1 = x == 1 ? 0 : seg.Ask(1, x - 1, 1, 1, n + m).sum;
  int res2 = seg.Ask(x, r, 1, 1, n + m).mn;
  // dbg(res1, res2);
  return res1 + res2 == 0;
}

inline int ErFen2(int R) {
  if (!Ck2(1, R)) return -1;
  int l = 1, r = R;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (Ck2(mid, R))
      l = mid;
    else
      r = mid - 1;
  }
  int res = Ck2(r, R) ? r : l;
  return res;
}

inline int ErFen1R(int R) {
  if (!Ck1(1, R)) return -1;
  int l = 1, r = R;
  while (r - l > 1) {
    int mid = (l + r) >> 1;
    if (Ck1(mid, R))
      l = mid;
    else
      r = mid - 1;
  }
  int res = Ck1(r, R) ? r : l;
  return res;
}

inline void Out(int id) {
  int cntyes = 0;
  // dbg(seg.Ask(1, 4, 1, 1, n + m).mn);
  // dbg(seg.Ask(1, 3, 1, 1, n + m).sum);
  // dbg(seg.Ask(3, 3, 1, 1, n + m).sum);
  // dbg(Ck2(4, 4));
  int lstsam = ErFen2(n + id);
  // dbg(lstsam);
  if (lstsam == -1)
    cntyes = 0;
  else
    cntyes = seg.Ask(1, lstsam, 1, 1, n + m).fcnt;
  int cntno = 0;
  int lstadd = ErFen1R(n + id);
  // dbg(lstadd);
  if (lstadd == -1)
    cntno = seg.Ask(1, n + id, 1, 1, n + m).zcnt;
  else
    cntno = seg.Ask(lstadd, n + id, 1, 1, n + m).zcnt;
  cout << cntyes << ' ' << cntno << '\n';
}

inline void Work() {
  cin >> n >> m;
  memset(seg.d, 0, sizeof(*seg.d) * ((n + m) << 2));
  re (i, n) seg.Cha(i, 1, 1, 1, n + m), pos[i] = i;
  re (id, m) {
    string op;
    cin >> op;
    if (op == "add") {
      if (!Add(id))
        cout << "bug\n";
      else
        Out(id);
    } else {
      int x, y;
      cin >> x >> y;
      if (!Test(id, x, y))
        cout << "bug\n";
      else
        Out(id);
    }
    // cerr << "";
  }
}

signed main() {
  // fio("card");
  ios::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  int T;
  cin >> T;
  while (T--) Work();
  return 0;
}