#include <bits/stdc++.h>
using namespace std;
using nagai = long long;
struct dss {
vector<pair<int,int>> segs;
void insert(int l, int r) {
segs.push_back({l, r});
}
int get(int l, int r, int k) {
if (k == 0) return segs.size();
int res = 0;
for (auto& x : segs) {
int ll = max(x.first, l), rr = min(x.second, r);
if (rr - ll + 1 >= k)
++res;
}
return res;
}
};
const int oo = 0x3f3f3f3f;
struct rofl2d {
vector<pair<int,int>> pts;
void insert(int x, int y) {
pts.push_back({x, y});
}
// all inclusive
int get(int x1, int x2, int y1, int y2) {
int res = 0;
for (auto p : pts)
if (x1 <= p.first && p.first <= x2 && y1 <= p.second && p.second <= y2)
++res;
return res;
}
};
struct ds {
int tot = 0;
rofl2d rofl_l, rofl_r;
void insert(int l, int r) {
++tot;
rofl_l.insert(l, r - l);
rofl_r.insert(r, r - l);
}
int get(int l, int r, int k) {
if (k == 0) return tot;
int res = tot;
res -= rofl_l.get(r - k + 2, oo, k - 1, oo);
res -= rofl_r.get(0, l + k - 2, k - 1, oo);
res -= rofl_l.get(0, oo, 0, k - 2);
return res;
}
};
int main() {
ios::sync_with_stdio(false);
cin.tie(0);
int n, t;
cin >> n >> t;
int lastans = 0;
vector<pair<int, int>> segs;
ds add, del;
while (n--) {
int tt;
cin >> tt;
if (tt == 1) {
int a, b;
cin >> a >> b;
a ^= t * lastans;
b ^= t * lastans;
if (a > b) swap(a, b);
segs.push_back({a, b});
add.insert(a, b);
}
else if (tt == 2) {
int id;
cin >> id;
--id;
del.insert(segs[id].first, segs[id].second);
}
else {
int a, b, k;
cin >> a >> b >> k;
a ^= t * lastans;
b ^= t * lastans;
if (a > b) swap(a, b);
lastans = add.get(a, b, k) - del.get(a, b, k);
cout << lastans << '\n';
}
}
}
