#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,tune=native")
#include <assert.h>
#include <stdio.h>
#include <string.h>
#include <stdlib.h>
#include <math.h>
#define N 200005
int V;
int n, t, na, nc, S, id = 1;
struct line { int l, r, w; } a[N], c[N], o[N];
int e[N], f[N], we[N], wf[N], pf[N], sz[N];
int compare_length(const void *a0, const void *b0)
{
const struct line *a = (const struct line*)a0, *b = (const struct line*)b0;
if (a->r - a->l != b->r - b->l) return ((a->r - a->l) - (b->r - b->l));
if (a->l != b->l) return a->l - b->l;
return a->w - b->w;
}
int compare_left_increasing_index(const void *a0, const void *b0)
{
const int aa = *(const int*)a0, bb = *(const int*)b0;
if (a[aa].l != a[bb].l) return a[aa].l - a[bb].l;
if (a[aa].r != a[bb].r) return a[aa].r - a[bb].r;
return a[aa].w - a[bb].w;
}
int compare_right_increasing_index(const void *a0, const void *b0)
{
const int aa = *(const int*)a0, bb = *(const int*)b0;
if (a[aa].r != a[bb].r) return a[aa].r - a[bb].r;
if (a[aa].l != a[bb].l) return a[aa].l - a[bb].l;
return a[aa].w - a[bb].w;
}
inline void rebuild()
{
for (; nc;) a[na++] = c[--nc];
qsort(a, na, sizeof *a, compare_length);
memset(sz, 0, sizeof *sz * (na / V + 1));
for (int i = 0; i < na; ++i) e[i] = f[i] = i, ++sz[i/V];
pf[0] = a[0].w;
for (int i = 1; i < na; ++i) pf[i] = pf[i-1] + a[i].w;
for (int i = 0; i * V <= na; ++i)
{
qsort(e+i*V, sz[i], sizeof *e, compare_left_increasing_index);
qsort(f+i*V, sz[i], sizeof *f, compare_right_increasing_index);
we[i*V+sz[i]-1] = a[e[i*V+sz[i]-1]].w;
for (int j = i*V+sz[i]-1; --j >= i*V;) we[j] = we[j+1] + a[e[j]].w;
wf[i*V] = a[f[i*V]].w;
for (int j = i*V+1; j < i*V+sz[i]; ++j) wf[j] = wf[j-1] + a[f[j]].w;
}
}
int main(void)
{
scanf("%d%d", &n, &t);
V = sqrt(n * log2(n));
for (int z = 0, lastans = 0, op, x, y, k, l, r; n--;)
{
scanf("%d%d", &op, &x);
switch (op)
{
case 1:
scanf("%d", &y);
l = x ^ (t * lastans), r = y ^ (t * lastans);
if (l>r) { int t=l;l=r;r=t;}
o[id++] = c[nc++] = (struct line){l, r, 1};
if (nc == V) rebuild();
++S;
break;
case 2:
c[nc++] = (struct line){o[x].l, o[x].r, -1};
if (nc == V) rebuild();
--S;
break;
default:
scanf("%d%d", &y, &k); z=0;
l = x ^ (t * lastans), r = y ^ (t * lastans);
if (l>r) { int t=l;l=r;r=t;}
/* count in static */
{
int Z = -1;
for (int L = 0, R = na-1; L <= R; )
{
int M = (L+R)/2;
if (a[M].r - a[M].l + 1 >= k) R = M - 1, Z = M;
else L = M + 1;
}
if (Z != -1)
{
z -= (Z>0) * pf[Z-1];
int zb = Z/V, sb = zb+1;
for (struct line *j = a + Z; j < a + sb * V; ++j) z -= (j->r < l + k - 1 || j->l > r - k + 1) * j->w;
for (int j = sb; j * V <= na; ++j)
{
/* r - j->l + 1 < k === j->l > r - k + 1 */
int cnt = 0;
for (int L = 0, R = sz[j]-1; L <= R;)
{
int M = (L+R)/2;
if (a[e[j*V+M]].l > r - k + 1) R = M - 1, cnt = we[j*V+M];
else L = M + 1;
}
z -= cnt;
cnt = 0;
/* j->r - l + 1 < k === j->l < k + l - 1 */
for (int L = 0, R = sz[j]-1; L <= R;)
{
int M = (L+R)/2;
if (a[f[j*V+M]].r < k + l - 1) L = M + 1, cnt = wf[j*V+M];
else R = M - 1;
}
z -= cnt;
}
}
}
/* count in buffer */
for (struct line *j = c; j < c + nc; ++j) z -= (j->r < l + k - 1 || j->l > r - k + 1) * j->w;
lastans = (z += S);
printf("%d\n", z);
break;
}
}
return 0;
}
