/*
________ ___ ________ ________ ________ ___ ________ ________ ________
|\ ____\|\ \|\ ____\|\ __ \ |\ ___ \|\ \|\ ____\|\ ____\|\ __ \
\ \ \___|\ \ \ \ \___|\ \ \|\ \ \ \ \\ \ \ \ \ \ \___|\ \ \___|\ \ \|\ \
\ \ \ __\ \ \ \ \ __\ \ __ \ \ \ \\ \ \ \ \ \ \ __\ \ \ __\ \ __ \
\ \ \|\ \ \ \ \ \|\ \ \ \ \ \ \ \ \\ \ \ \ \ \ \|\ \ \ \|\ \ \ \ \ \
\ \_______\ \__\ \_______\ \__\ \__\ \ \__\\ \__\ \__\ \_______\ \_______\ \__\ \__\
\|_______|\|__|\|_______|\|__|\|__| \|__| \|__|\|__|\|_______|\|_______|\|__|\|__|
________ ________ ________ ________ ___ ___ ________ _________ ___ ________ ________
|\ __ \|\ __ \|\ __ \|\ ___ \|\ \|\ \|\ ____\\___ ___\\ \|\ __ \|\ ___ \
\ \ \|\ \ \ \|\ \ \ \|\ \ \ \_|\ \ \ \\\ \ \ \___\|___ \ \_\ \ \ \ \|\ \ \ \\ \ \
\ \ ____\ \ _ _\ \ \\\ \ \ \ \\ \ \ \\\ \ \ \ \ \ \ \ \ \ \ \\\ \ \ \\ \ \
\ \ \___|\ \ \\ \\ \ \\\ \ \ \_\\ \ \ \\\ \ \ \____ \ \ \ \ \ \ \ \\\ \ \ \\ \ \
\ \__\ \ \__\\ _\\ \_______\ \_______\ \_______\ \_______\ \ \__\ \ \__\ \_______\ \__\\ \__\
\|__| \|__|\|__|\|_______|\|_______|\|_______|\|_______| \|__| \|__|\|_______|\|__| \|__|
Written by: giga nigga
*/
// #include "largest.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
// mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double wow = (double) ((ull) rng()) / ((ull)(0-1));
return wow * (r - l) + l;
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int BLOCK = 6900;
const int INF = 2e9 + 69;
struct BigDickArray{
int n;
vector<int> l, r;
array<int, 3300069> arr;
BigDickArray(){
}
void resize(int _n){
n = _n;
l.resize(n+1); r.resize(n+1);
}
void clear(){
l.clear(); r.clear();
}
void fake_pb(int i){
r[i]++;
}
void build_arr(){
for(int i= 1; i <= n; ++i){
l[i] = l[i-1] + r[i-1];
}
for(int i = 0; i <= n; ++i) r[i] = l[i];
}
void pub(int i, int j){
arr[r[i]++] = j;
}
int find_first(int i, int x){
return upper_bound(arr.begin() + l[i], arr.begin() + r[i], x) - arr.begin() - l[i];
}
void print(){
for(int i = 0; i <= n; ++i){
for(int j = l[i]; j < r[i]; ++j) cout << arr[j] << " ";
cout << "\n";
}
}
};
struct FenwickTree{
int n;
vector<int> X;
BigDickArray val;
vector<pair<int,int>> points;
FenwickTree(){
}
void clear(){
val.clear();
points.clear();
}
void add_points(pair<int, int> p){
points.push_back(p);
}
void build_tree(){
sort(ALL(points), [](pair<int, int> x, pair<int, int> y){
return x.second < y.second;
});
n = X.size() - 1;
val.resize(n);
for(auto i: points){
while(i.first <= n){
val.fake_pb(i.first);
i.first += LASTBIT(i.first);
}
}
val.build_arr();
for(auto i: points){
while(i.first <= n){
val.pub(i.first, i.second);
i.first += LASTBIT(i.first);
}
}
}
int get(int i, int j){
i = upper_bound(ALL(X), i) - X.begin() - 1;
int ans = 0;
while(i > 0){
int idx = val.find_first(i, j);
ans += idx;
i -= LASTBIT(i);
}
return ans;
}
};
void solve(){
int q, t; cin >> q >> t;
vector<pair<int, int>> range_list;
vector<bool> activated;
vector<array<int, 3>> ranges;
int last_ans = 0;
FenwickTree st1, st2;
int tot = 0;
vector<int> len_list;
for(int it = 1; it <= q; ++it){
if (it % BLOCK == 0){
tot = 0;
len_list.clear();
st1.clear(); st2.clear();
ranges.clear();
vector<int> X; X.push_back(-INF);
for(int i = 0; i < (int) range_list.size(); ++i) if (activated[i]){
tot++;
int l, r; tie(l, r) = range_list[i];
int len = r - l + 1;
X.push_back(-len);
len_list.push_back(len);
}
sort(ALL(X));
st1.X = X; st2.X = X;
for(int i = 0; i < (int) range_list.size(); ++i) if (activated[i]){
int l, r; tie(l, r) = range_list[i];
int len = r - l + 1;
int idx = lower_bound(ALL(X), -len) - X.begin();
st1.add_points(make_pair(idx, r));
st2.add_points(make_pair(idx, -l));
}
st1.build_tree(); st2.build_tree();
sort(ALL(len_list));
}
int type; cin >> type;
if (type == 1){
int a, b; cin >> a >> b;
a ^= t * last_ans;
b ^= t * last_ans;
if (a > b) swap(a, b);
range_list.push_back({a, b});
activated.push_back(1);
ranges.push_back({{a, b, 1}});
}
else if (type == 2){
int id; cin >> id;
id--;
activated[id] = 0;
int a, b; tie(a, b) = range_list[id];
ranges.push_back({{a, b, -1}});
}
else{
int l, r, k; cin >> l >> r >> k;
l ^= t * last_ans;
r ^= t * last_ans;
if (l > r) swap(l, r);
if (r - l + 1 < k){
cout << 0 << "\n";
last_ans = 0;
continue;
}
int ans = tot;
for(auto i: ranges){
int L = max(l, i[0]);
int R = min(r, i[1]);
if (R - L + 1 >= k) ans += i[2];
}
ans -= lower_bound(ALL(len_list), k) - len_list.begin();
ans -= st1.get(-k, l + k - 2);
ans -= st2.get(-k, -(r - k + 2));
cout << ans << "\n";
last_ans = ans;
}
}
}
int main(void){
ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
clock_t start = clock();
solve();
cerr << "Time elapsed: " << clock() - start << "ms!\n";
return 0;
}
