#include<bits/stdc++.h>
#pragma optimize ("g",on)
#pragma GCC optimize ("inline")
#pragma GCC optimize ("Ofast")
#pragma GCC optimize ("unroll-loops")
#pragma GCC optimize ("03")
#pragma GCC target ("sse,sse2,sse3,ssse3,sse4,popcnt,abm,avx2,mmx,fma,avx,tune=native")
#pragma comment(linker, "/stack:200000000")
//01001101 01100001 01101011 01101000 01100001 01100111 01100001 01111001
using namespace std;
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define ll long long
#define pb push_back
#define sz(a) a.size()
#define nl '\n'
#define popb pop_back()
#define ld double
#define ull unsigned long long
#define ff first
#define ss second
#define fix fixed << setprecision
#define pii pair<int, int>
#define E exit (0)
#define int long long
const int inf = 1e9, N = 1e6 + 1, mod = 998244353;
vector<pii> dir = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
int intersect(int l, int r, int tl, int tr) {
l = max(l, tl);
r = min(r, tr);
return max(0ll, r - l + 1);
}
main() {
//freopen("cowrect.in", "r", stdin);
//freopen("cowrect.out", "w", stdout);
ios_base::sync_with_stdio(NULL);
cin.tie(NULL);
int n, vl;
cin >> n >> vl;
set<int> s, h;
for (int i = 1; i <= n; i++) s.insert(i);
int ans = 0, tl[n + 1], tr[n + 1];
while (n--) {
int t;
cin >> t;
if (t == 1) {
int l, r;
cin >> l >> r;
l ^= (vl * ans);
r ^= (vl * ans);
if (l > r) swap(l, r);
tl[*s.begin()] = l;
tr[*s.begin()] = r;
h.insert(*s.begin());
s.erase(s.begin());
}else if (t == 2) {
int ind;
cin >> ind;
h.erase(ind);
}else {
int l, r, k;
cin >> l >> r >> k;
l ^= (vl * ans);
r ^= (vl * ans);
if (l > r) swap(l, r);
int cur = 0;
for (auto e: h) {
if (intersect(l, r, tl[e], tr[e]) >= k) cur++;
}
cout << cur << nl;
ans = cur;
}
}
}
