#include <cassert>
#include <cmath>
#include <cstdint>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <functional>
#include <iostream>
#include <limits>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <utility>
#include <vector>

using namespace std;

using Int = long long;

template <class T1, class T2> ostream &operator<<(ostream &os, const pair<T1, T2> &a) { return os << "(" << a.first << ", " << a.second << ")"; };
template <class T> ostream &operator<<(ostream &os, const vector<T> &as) { const int sz = as.size(); os << "["; for (int i = 0; i < sz; ++i) { if (i >= 256) { os << ", ..."; break; } if (i > 0) { os << ", "; } os << as[i]; } return os << "]"; }
template <class T> void pv(T a, T b) { for (T i = a; i != b; ++i) cerr << *i << " "; cerr << endl; }
template <class T> bool chmin(T &t, const T &f) { if (t > f) { t = f; return true; } return false; }
template <class T> bool chmax(T &t, const T &f) { if (t < f) { t = f; return true; } return false; }
#define COLOR(s) ("\x1b[" s "m")


int root(int *uf, int u) {
  return (uf[u] < 0) ? u : (uf[u] = root(uf, uf[u]));
}
bool connect(int *uf, int u, int v) {
  u = root(uf, u);
  v = root(uf, v);
  if (u == v) return false;
  if (uf[u] > uf[v]) swap(u, v);
  uf[u] += uf[v];
  uf[v] = u;
  return true;
}


int T, N, Q;
vector<int> O, X, Y;


namespace brute {
int ufs[7510][7510];
vector<int> run() {
cerr<<"[brute::run]"<<endl;
  memset(ufs, ~0, sizeof(ufs));
  vector<int> anss;
  int lastans = 0;
  for (int q = 0; q < Q; ++q) {
    const int x = (X[q] - 1 + T * lastans) % N + 1;
    const int y = (Y[q] - 1 + T * lastans) % N + 1;
// cerr<<COLOR("33")<<O[q]<<" "<<x<<" "<<y<<COLOR()<<endl;
    if (O[q] == 1) {
      int lo = max(x, y) - 1, hi = N + 1;
      for (; lo + 1 < hi; ) {
        const int mid = (lo + hi) / 2;
        ((root(ufs[mid], x) == root(ufs[mid], y)) ? hi : lo) = mid;
      }
      for (int z = max(x, y); z <= lo; ++z) {
        connect(ufs[z], x, y);
      }
    } else {
      const int ans = -ufs[y][root(ufs[y], x)];
      anss.push_back(ans);
      lastans = ans;
    }
  }
  return anss;
}
} // brute


int main() {
  for (; ~scanf("%d%d%d", &T, &N, &Q); ) {
    O.resize(Q);
    X.resize(Q);
    Y.resize(Q);
    for (int q = 0; q < Q; ++q) {
      scanf("%d%d%d", &O[q], &X[q], &Y[q]);
    }
    
    const auto anss = brute::run();
    for (const int ans : anss) {
      printf("%d\n", ans);
    }
  }
  return 0;
}