#pragma GCC target ("avx2")
#pragma GCC optimization ("O3")
#pragma GCC optimization ("Ofast")
#pragma GCC optimization ("unroll-loops")
#include <bits/stdc++.h>
#define pb push_back
using namespace std;
const int N = 2e5 + 5;
const int Sq = 1700;
int A[N], B[N], C[N];
int n, u, t, bl, lastans;
int sq = 1800;
bool cmp(int x, int y) {
return C[x] < C[y];
}
struct {
vector < int > u, c, ol;
vector < int > L[N / Sq], R[N / Sq];
void insert(int id) {
u.pb(id);
if (u.size() == sq) {
c.reserve(u.size() + ol.size());
sort(u.begin(), u.end(), cmp);
merge(u.begin(), u.end(), ol.begin(), ol.end(), back_inserter(c));
ol.swap(c), c.clear(), u.clear();
for (int bl = 0; bl*sq < ol.size(); ++bl) {
L[bl].clear(), R[bl].clear();
}
for (int i = 0; i < ol.size(); ++i) {
bl = i / sq;
L[bl].pb(A[ol[i]]);
R[bl].pb(B[ol[i]]);
}
for (int bl = 0; bl*sq < ol.size(); ++bl) {
sort(L[bl].begin(),L[bl].end());
sort(R[bl].begin(),R[bl].end());
}
}
}
int solve(int l, int r, int k) {
if (r - l + 1 < k) return 0;
int ans = 0, s, f, S, F, i;
for (i = 0; i < u.size(); ++i)
if (min(r, B[u[i]]) - max(l, A[u[i]]) + 1 >= k)
++ans;
for (s = 0; s < ol.size(); s += sq) {
f = min(s + sq - 1, (int)ol.size() - 1);
S = ol[s], F = ol[f];
if (C[S] >= k) {
bl = f / sq;
ans += f - s + 1;
ans -= L[bl].end() - upper_bound(L[bl].begin(), L[bl].end(), r - k + 1);
ans -= lower_bound(R[bl].begin(), R[bl].end(), l + k - 1) - R[bl].begin();
}
else
if (C[F] >= k) {
for (i = s; i <= f; ++i)
if (min(r, B[ol[i]]) - max(l, A[ol[i]]) + 1 >= k)
++ans;
}
}
return ans;
}
} rcur, cur;
int G(int &x, int &y) {
x = (x ^ (t * lastans));
y = (y ^ (t * lastans));
if (x > y) swap(x, y);
return y - x + 1;
}
main () {
scanf("%d %d",&n, &t);
int ty, id, l, r, k;
for (int i = 0; i < n; ++i) {
scanf("%d",&ty);
if (ty == 1) {
scanf("%d %d",&A[u],&B[u]);
C[u] = G(A[u], B[u]);
cur.insert(u), ++u;
}
else
if (ty == 2) {
scanf("%d",&id); --id;
rcur.insert(id);
}
else
if (ty == 3) {
scanf("%d %d %d",&l, &r, &k); G(l, r);
lastans = cur.solve(l, r, k) - rcur.solve(l, r, k);
printf("%d\n", lastans);
}
}
}
