#ifdef ONLINE_JUDGE
#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops,fast-math,O3")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#endif
#include <bits/stdc++.h>
#define speed \
ios_base::sync_with_stdio(0); \
cin.tie(0); \
cout.tie(0);
#define precision \
cout.precision(30); \
cerr.precision(10);
#define ll long long
#define ld long double
#define pb(x) push_back(x)
#define sz(x) (int)x.size()
#define mp(x, y) make_pair(x, y)
#define all(x) x.begin(), x.end()
#define pc(x) __builtin_popcount(x)
#define pcll(x) __builtin_popcountll(x)
#define F first
#define S second
using namespace std;
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
void ioi(string name) {
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
int n, m, g, t, h, lastans, a[2][200005];
inline int kek(int l, int r, int x) {
int new_ans = 0;
#pragma GCC ivdep
#pragma loop(hint_parallel(8))
for (int i = 1; i <= g; i++)
new_ans += a[0][i] <= r - x + 1 && a[1][i] >= l + x - 1 &&
x <= -a[0][i] + a[1][i] + 1;
return new_ans;
}
int main() {
speed;
precision;
// code
cin >> n >> t;
assert(n <= 2e5);
m = n;
while (m--) {
int type, l, r, x;
cin >> type;
if (type == 1) {
cin >> l >> r;
l ^= t * lastans;
r ^= t * lastans;
if (l > r) swap(l, r);
++g;
a[0][g] = l;
a[1][g] = r;
}
if (type == 2) {
cin >> x;
a[0][x] = 1e9;
a[1][x] = -1e9;
}
if (type == 3) {
cin >> l >> r >> x;
l ^= t * lastans;
r ^= t * lastans;
if (l > r) swap(l, r);
cout << (lastans = kek(l, r, x)) << "\n";
}
}
// endl
#ifndef ONLINE_JUDGE
cerr << "\nTime elapsed: " << 1.0 * clock() / CLOCKS_PER_SEC << " s.\n";
#endif
return 0;
}
