#pragma GCC optimize("Ofast")
#pragma loop_opt(on)
#include <bits/extc++.h>
#ifdef local
#define safe std::cerr<<__PRETTY_FUNCTION__<<" line "<<__LINE__<<" safe\n"
#define debug(a...) qqbx(#a, a)
template <typename ...T> void qqbx(const char *s, T ...a) {
int cnt = sizeof...(T);
((std::cerr << "\033[1;32m(" << s << ") = (") , ... , (std::cerr << a << (--cnt ? ", " : ")\033[0m\n")));
}
#else
#define safe ((void)0)
#define debug(...) ((void)0)
#endif // local
#define all(v) begin(v),end(v)
using namespace std;
using namespace __gnu_pbds;
template <typename T> using rbt = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef int64_t ll;
constexpr ll maxn = 200025, INF = 1e18, MOD = 998244353, K = 14699, inf = 1e9;
struct Fenwick1D {
int sum[maxn];
void add(int p, int d) {
for (; p < maxn; p += p & -p) sum[p] += d;
}
int query(int p) {
int res = 0;
for (; p > 0; p -= p & -p) res += sum[p];
return res;
}
} len;
struct Fenwick2D {
rbt<pair<int,int>> b[maxn];
int tot;
void add(int x, int y, int k) {
for (; x < maxn; x += x & -x) {
if (k == 1)
b[x].insert({ y, tot++ });
else if (k == -1)
b[x].erase(b[x].lower_bound({ y, 0 }));
}
}
int query(int x, int y) {
int res = 0;
for (; x > 0; x -= x & -x)
res += b[x].order_of_key({ y+1, 0 }); // how many <= y
return res;
}
} tl, tr;
pair<int,int> seg[maxn];
int segId = 0;
void add(int l, int r, int k) {
len.add(maxn-1 - (r - l), k);
tl.add(maxn-1 - (r - l), r, k);
tr.add(maxn-1 - (r - l), maxn-1 - l, k);
}
// bool dead[maxn];
int query(int l, int r, int k) {
return len.query(maxn-1 - k) - tl.query(maxn-1 - k, l + k - 1) - tr.query(maxn-1 - k, maxn-1 - (r - k + 1));
/*
int res = 0;
for (int i = 0; i < segId; i++) {
if (dead[i]) continue;
auto [nl, nr] = seg[i];
if (nr - nl >= k) {
++res;
if (nr < l + k) --res;
if (nl > r - k) --res;
}
}
return res;
*/
}
signed main() {
ios_base::sync_with_stdio(0), cin.tie(0);
int n, encode;
cin >> n >> encode;
int ans = 0;
for (int i = 0; i < n; i++) {
int t;
cin >> t;
if (t == 1) {
int a, b;
cin >> a >> b;
if (encode) a ^= ans, b ^= ans;
if (a > b) swap(a, b);
++b;
add(a, b, 1);
seg[segId++] = { a, b };
} else if (t == 2) {
int id;
cin >> id;
--id;
auto [a, b] = seg[id];
add(a, b, -1);
// dead[id] = true;
} else if (t == 3) {
int a, b, k;
cin >> a >> b >> k;
if (encode) a ^= ans, b ^= ans;
if (a > b) swap(a, b);
++b;
ans = query(a, b, k);
cout << ans << '\n';
}
}
}
/*
6 1
1 1 2
3 2 4 2
1 3 5
3 2 3 1
2 1
3 0 3 1
6 0
1 3 10
1 3 5
3 6 10 6
2 1
1 3 10
3 6 4 2
*/
