//-------------dilanyan------------\\
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<stdio.h>
using namespace std;
//------------------KarginDefines--------------------\\
#define ll long long
#define pb push_back
#define all(u) (u).begin(), (u).end()
#define pqueue priority_queue
#define upper upper_bound
#define lower lower_bound
#define umap unordered_map
#define uset unordered_set
#define Kargin ios_base::sync_with_stdio(false);cin.tie(NULL);
#define Usaco freopen(".in", "r", stdin); freopen(".out", "w", stdout);
//-------------------KarginConstants------------------\\
const ll mod = 1000000007;
const ll inf = 2e9;
//-------------------KarginCode------------------------\\
const int N = 200005;
void KarginSolve() {
int n, t;
cin >> n >> t;
multiset<pair<int, pair<int, int>>> mst;
vector<pair<int, int>> in(n + 1);
int lastans = 0;
int ind = 1;
for (int i = 0;i < n;i++) {
int type; cin >> type;
if (type == 1) {
int a, b;
cin >> a >> b;
a = a ^ (t * lastans), b = b ^ (t * lastans);
if (a > b) swap(a, b);
mst.insert({ ind,{a,b} });
in[ind] = { a,b };
ind++;
}
else if (type == 2) {
int ind; cin >> ind;
mst.erase({ ind,in[ind] });
}
else {
int a, b, k;
cin >> a >> b >> k;
a = a ^ (t * lastans), b = b ^ (t * lastans);
if (a > b) swap(a, b);
int ans = 0;
for (auto it : mst) {
int l = a, r = b;
int lx = it.second.first, rx = it.second.second;
if (l > lx) swap(l, lx), swap(r, rx);
if (r < lx) continue;
if (lx >= l && rx <= r) ans += (rx - lx + 1 >= k);
else if (l >= lx && r <= rx) ans += (r - l + 1 >= k);
else ans += (r - lx + 1 >= k);
}
cout << ans << '\n';
lastans = ans;
}
}
}
int main() {
//Usaco
Kargin;
int test = 1;
//cin >> test;
while (test--) {
KarginSolve();
}
return 0;
}
