#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) static_cast<int>((v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 5e5 + 9;
int T, n, m;

struct {
  int ch[2], p;
  int s, sk;

  int operator [] (int d) const { return ch[d]; }
  int& operator [] (int d) { return ch[d]; }
} t[N];

#define ls(u) t[u][0]
#define rs(u) t[u][1]
#define fa(u) t[u].p

IL void up (int p) {
  t[p].s = t[ls(p)].s + t[rs(p)].s + t[p].sk + 1;
}

IL bool nrt (int p) {
  return p == ls(fa(p)) || p == rs(fa(p));
}

IL int pos (int p) {
  return p == rs(fa(p));
}

IL void rot (int p) {
  int q = fa(p), o = pos(p);
  if (nrt(q)) {
    t[fa(q)][pos(q)] = p;
  }
  fa(p) = fa(q);
  fa(q) = p;
  int w = t[p][o ^ 1];
  t[q][o] = w;
  t[p][o ^ 1] = q;
  if (w) {
    fa(w) = q;
  }
  up(q);
  up(p);
}

void splay (int p) {
  for (; nrt(p); rot(p)) {
    if (nrt(fa(p))) {
      rot(pos(p) == pos(fa(p)) ? fa(p) : p);
    }
  }
}

void access (int p) {
  for (int i = 0; p; p = fa(i = p)) {
    splay(p);
    t[p].sk += t[rs(p)].s - t[i].s;
    rs(p) = i;
    up(p);
  }
}

int unite (int x, int y) {
  if (!x || !y) {
    return x | y;
  }
  while (rs(y)) {
    y = rs(y);
  }
  splay(y);
  int p = 0, l = x;
  while (x) {
    if (x < y) {
      if (p < x) {
        p = x;
      }
      x = ls(x);
    } else {
      x = rs(x);
    }
  }
  if (!p) {
    return unite(y, l);
  }
  x = p;
  splay(x);
  int nx = t[x][0], ny = t[y][0];
  t[x][0] = 0;
  up(x);
  fa(nx) = fa(ny) = 0;
  int z = unite(ny, nx);
  t[y][0] = z;
  t[y][1] = x;
  fa(x) = fa(z) = y;
  up(y);
  return y;
}

void mdy (int x, int y) {
  access(x);
  access(y);
  splay(x);
  int f = fa(x);
  if (!f || f == y) {
    return;
  }
  splay(f);
  t[f].sk -= t[x].s;
  t[f].s -= t[x].s;
  up(f);
  fa(unite(x, f)) = 0;
}

int dfs (int p, int l) {
  if (!p) {
    return 0;
  }
  if (p <= l) {
    int q = dfs(ls(p), l);
    return q ? q : p;
  } else {
    return dfs(rs(p), l);
  }
}

int qry (int x, int l) {
  access(x);
  splay(x);
  int y = dfs(x, l);
  splay(y);
  return t[rs(y)].s + t[y].sk + 1;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> T >> n >> m;
  L (i, 1, n) {
    fa(i) = n + 1;
    t[i].s = 1;
  }
  t[n + 1].s = t[n + 1].sk = n;
  int las = 0;
  L (i, 1, m) {
    int o, x, y;
    cin >> o >> x >> y;
    x = (x - 1 + T * las) % n + 1;
    y = (y - 1 + T * las) % n + 1;
    if (o == 1) {
      mdy(x, y);
    } else {
      cout << qry(x, y) << '\n';
    }
  }
}
// I love WHQ!