#include <cstdio>
#include <cstring>
#include <algorithm>
#include <numeric>
#include <vector>
#include <queue>
#include <map>
#include <cmath>
#include <cctype>
#include <set>

namespace uvu
{
#define LOCAL ____________DONT_DEFINE_ME____________
#define ll long long
#define inf 0x3f3f3f3f
// #define int long long
// #define inf 0x3f3f3f3f3f3f3f3fll
#define infll 0x3f3f3f3f3f3f3f3fll
#define debug(...) fprintf(stderr, __VA_ARGS__)
#define gline debug("now is #%d\n", __LINE__)
#define pii std::pair <int, int>
#define mkp std::make_pair
#define fi first
#define se second
char _ST_;
const int BUFSIZE = (1 << 20);
char ibuf[BUFSIZE], *iS = ibuf, *iT = ibuf;
char obuf[BUFSIZE], *oS = obuf, *oT = obuf + BUFSIZE;
char getc()
{
#ifdef LOCAL
	return getchar();
#else
	if(iS == iT) iT = (iS = ibuf) + fread(ibuf, 1, BUFSIZE, stdin);
	return iS == iT ? EOF : *iS++;
#endif
#define getchar ERR
}

void Flush() { fwrite(obuf, 1, oS - obuf, stdout); oS = obuf; }
struct Flusher { ~Flusher(){ Flush(); } }iamflusher;

void putc(char c)
{
#ifdef LOCAL
	putchar(c);
#else
	*oS++ = c;
	if(oS == oT) Flush();
#endif
#define putchar ERR
}

template <typename T = int> T read()
{
	T x = 0, f = 1; char c = getc();
	for(; !isdigit(c); c = getc()) if(c == '-') f = -1;
	for(;  isdigit(c); c = getc()) x = (x << 3) + (x << 1) + (c ^ 48);
	return x * f;
}

template <typename T> void print(T x, char c)
{
static int sta[BUFSIZE], top;
	top = 0;
	if(x < 0) putc('-'), x = -x;
	if(!x) sta[top = 1] = 0;
	for(; x; x /= 10) sta[++top] = x % 10;
	for(; top; ) putc(sta[top--] ^ 48);
	if(c) putc(c);
}

int readstr(char *s, int base)
{
	int idx = base - 1; char c = getc();
	for(; !(isdigit(c) || isalpha(c) || c == '#' || c == '.'); c = getc());
	for(;   isdigit(c) || isalpha(c) || c == '#' || c == '.' ; c = getc()) s[++idx] = c;
	return idx - base + 1;
}

void printf(const char *s) { for(; *s; s++) putc(*s); }
template <typename T, typename ... Args>
void printf(const char *s, T x, Args ... rest)
{
	for(; *s; s++)
	{
		if(*s != '%') { putc(*s); continue; }
		s++; if(*s == 'd') print(x, 0);
		else if(*s == 'c') putc(x);
		printf(s + 1, rest ...);
		return;
	}
}

template <typename T> void ckmax(T &x, T y) { x = x > y ? x : y; }
template <typename T> void ckmin(T &x, T y) { x = x < y ? x : y; }
#define mod 998244353
// #define mod 1000000007
int sm(int x) { return x >= mod ? x - mod : x; }
void plus_(int &x, int y) { x = sm(x + y); }
void mul_(int &x, int y) { x = 1ll * x * y % mod; }
int ksm(int a, int b) { int res = 1; for(; b; b >>= 1, mul_(a, a)) if(b & 1) mul_(res, a); return res; }

#define N 500010
int OP, n, m;
struct Tree
{
	int f, ch[2], sz, lightsz, L;
}tr[N];
#define fa(k) tr[k].f
#define lson(k) tr[k].ch[0]
#define rson(k) tr[k].ch[1]
#define son(k, i) tr[k].ch[i]
void pushup(int k) { tr[k].sz = tr[lson(k)].sz + tr[rson(k)].sz + 1 + tr[k].lightsz; tr[k].L = lson(k) ? tr[lson(k)].L : k; }
bool notroot(int k) { return lson(fa(k)) == k || rson(fa(k)) == k; }
bool getid(int k) { return rson(fa(k)) == k; }
void rotate(int k)
{
	int f = fa(k), gf = fa(f), id = getid(k), fid = getid(f), s = son(k, id ^ 1);
	if(notroot(f)) son(gf, fid) = k;
	fa(fa(fa(son(son(k, id ^ 1) = f, id) = s) = f) = k) = gf;
	pushup(f); pushup(k);
}

void splay(int k) { for(; notroot(k); rotate(k)) if(notroot(fa(k))) rotate(getid(k) == getid(fa(k)) ? fa(k) : k); }
int access(int k) { int nx = 0; for(; k; k = fa(nx = k)) { splay(k); tr[k].lightsz += tr[rson(k)].sz - tr[nx].sz; rson(k) = nx; pushup(k); } return nx; }
int divide(int k, int z)
{
	int res = k;
	while(k)
	{
		if(k >= z) res = k, k = rson(k);
		else k = lson(k);
	}
	return res;
}
void merge(int x, int y)
{
	int las = 0, nx;
	if(x) splay(x);
	if(y) splay(y);
	while(x || y)
	{
		if(tr[x].L < tr[y].L) x ^= y ^= x ^= y;
		// printf("x = %d, y = %d (%d %d)\n", x, y, tr[x].L, tr[y].L);
		x = divide(x, tr[y].L); splay(x);
		// printf("x -> %d\n", x);
		if(las) rson(las) = x, fa(x) = las, pushup(las);
		splay(x); las = x;
		if((nx = rson(x))) fa(rson(x)) = 0, rson(x) = 0;
		pushup(x); x = nx; if(nx) splay(nx);
	}
}

void solve()
{
	// memset(h, idx = -1, sizeof(h));
	OP = read(), n = read(), m = read();
	for(int i = 1; i <= n; i++) fa(i) = n + 1, tr[i].sz = 1;
	for(int i = 1; i <= n + 1; i++) tr[i].L = i;
	tr[n + 1].sz = n + 1; tr[n + 1].lightsz = n;
	int lastans = 0;
	for(int i = 1, op, x, y; i <= m; i++)
	{
		op = read(), x = read(), y = read();
		x = (x - 1 + OP * lastans) % n + 1;
		y = (y - 1 + OP * lastans) % n + 1;
		// printf("[%d %d %d]\n", op, x, y);
		if(op == 1)
		{
			access(x); 
			// for(int i = 1; i <= n + 1; i++) printf("fa[%d] = %d, lson = %d, rson = %d, L = %d\n", i, fa(i), lson(i), rson(i), tr[i].L);
			int p = access(y);
			// for(int i = 1; i <= n + 1; i++) printf("fa[%d] = %d, lson = %d, rson = %d, L = %d\n", i, fa(i), lson(i), rson(i), tr[i].L);
		// for(int i = 1; i <= n + 1; i++) printf("fa[%d] = %d, lson = %d, rson = %d, L = %d (%d %d)\n", i, fa(i), lson(i), rson(i), tr[i].L, tr[i].sz, tr[i].lightsz);
			if(p == x || p == y) continue;
			merge(x, y);
		}
		else
		{
			access(x);
			splay(x);
			int res = 0;
			while(x)
			{
				if(x <= y) res += tr[x].sz - tr[lson(x)].sz, x = lson(x);
				else x = rson(x);
			}
			print(lastans = res, '\n');
		}
		// printf("[%d %d]\n", tr[0].sz, tr[0].lightsz);
		// for(int i = 1; i <= n + 1; i++) printf("fa[%d] = %d, lson = %d, rson = %d, L = %d (%d %d)\n", i, fa(i), lson(i), rson(i), tr[i].L, tr[i].sz, tr[i].lightsz);
	}
}

void init()
{

}

char _ED_;

void mian()
{
	debug("%.3f MB\n", abs(&_ST_ - &_ED_) / 1024.0 / 1024);
	init();
	for(int T = 1; T; solve(), T--);
}

#ifdef int
	#undef int
#endif
}

int main()
{
	// freopen("tmp.in", "r", stdin);
	// freopen("tmp.out", "w", stdout);
	uvu::mian(); return 0;
}