#include<bits/stdc++.h>
#define taskname "A"
using namespace std;
typedef long long ll;
int n, t;
namespace sub1{
void solve(){
vector<bool>out(n, false);
vector<pair<int, int>>range;
for(int _ = 0, last_ans = 0; _ < n; _++){
int type;
cin >> type;
if(type == 1){
int a, b;
cin >> a >> b;
if(t == 1){
a ^= last_ans;
b ^= last_ans;
}
if(a > b){
swap(a, b);
}
range.emplace_back(a, b);
}
else if(type == 2){
int id;
cin >> id;
out[id - 1] = true;
}
else{
int a, b, k, ans = 0;
cin >> a >> b >> k;
if(t == 1){
a ^= last_ans;
b ^= last_ans;
}
if(a > b){
swap(a, b);
}
for(int i = 0; i < range.size(); i++){
if(!out[i] && min(range[i].second, b) - max(range[i].first, a) + 1 >= k){
ans++;
}
}
cout << (last_ans = ans) << "\n";
}
}
}
}
namespace sub23456{
const int SIZE = 1;
const int INF = 2e9 + 1e8;
const int lim = 2e5 + 5;
struct Node{
int lc, rc, cnt;
Node(){
lc = rc = -1;
cnt = 0;
}
};
struct PersistentBIT{
vector<int>p, v;
vector<pair<int, int>>bit[lim];
int N;
void update(int t, int p){
for(; p <= N; p += p & -p){
if(bit[p].empty()){
bit[p].emplace_back(t, 0);
}
else if(bit[p].back().first < t){
bit[p].emplace_back(bit[p].back());
bit[p].back().first = t;
}
bit[p].back().second++;
}
}
void build(vector<pair<int, int>>& range){
if(range.empty()){
N = 0;
return;
}
p.clear();
v.clear();
p.emplace_back(-1);
p.emplace_back(range[0].first);
v.emplace_back(-1);
v.emplace_back(range[0].second);
for(int i = 1; i < range.size(); i++){
if(range[i].first != range[i - 1].first){
p.emplace_back(range[i].first);
}
v.emplace_back(range[i].second);
}
sort(v.begin(), v.end());
v.resize(unique(v.begin(), v.end()) - v.begin());
N = v.size();
for(int i = 1; i <= N; i++){
bit[i].clear();
}
for(int i = 0, j = 0; i < range.size(); i++){
if(range[i].first != p[j]){
j++;
}
update(j, lower_bound(v.begin(), v.end(), range[i].second) - v.begin());
}
}
int get_cnt(int t, int p){
int ans = 0;
for(; p > 0; p -= p & -p){
if(!bit[p].empty() && bit[p][0].first <= t){
ans += bit[p][upper_bound(bit[p].begin(), bit[p].end(), make_pair(t, INF)) - bit[p].begin() - 1].second;
}
}
return ans;
}
int get(int P, int l, int r){
if(N == 0){
return 0;
}
l = lower_bound(v.begin(), v.end(), l) - v.begin();
r = upper_bound(v.begin(), v.end(), r) - v.begin() - 1;
P = upper_bound(p.begin(), p.end(), P) - p.begin() - 1;
return get_cnt(P, r) - get_cnt(P, l - 1);
}
};
PersistentBIT bit_1, bit_2;
void solve(){
vector<bool>out(n, false);
vector<pair<int, int>>range;
vector<int>add, rem;
for(int iq = 0, last_ans = 0, pre_range; iq < n; iq++){
if(iq % SIZE == 0){
add.clear();
rem.clear();
vector<pair<int, int>>bit_range;
for(int i = 0; i < range.size(); i++){
if(!out[i]){
bit_range.emplace_back(range[i]);
}
}
sort(bit_range.begin(), bit_range.end());
bit_1.build(bit_range);
for(int i = 0; i < bit_range.size(); i++){
bit_range[i].second -= bit_range[i].first - 1;
}
bit_2.build(bit_range);
pre_range = int(range.size()) - 1;
}
int type;
cin >> type;
if(type == 1){
int a, b;
cin >> a >> b;
if(t == 1){
a ^= last_ans;
b ^= last_ans;
}
if(a > b){
swap(a, b);
}
add.emplace_back(range.size());
range.emplace_back(a, b);
}
else if(type == 2){
int i;
cin >> i;
out[--i] = true;
if(i <= pre_range){
rem.emplace_back(i);
}
}
else{
int a, b, k;
cin >> a >> b >> k;
if(t == 1){
a ^= last_ans;
b ^= last_ans;
}
if(a > b){
swap(a, b);
}
if(b - a + 1 < k){
cout << (last_ans = 0) << "\n";
continue;
}
int ans = bit_1.get(b - k + 1, a + k - 1, INF) + bit_1.get(a + k - 2, a, a + k - 2) - bit_1.get(a - 1, a, a + k - 2) - bit_2.get(b - k + 1, 0, k - 1) + bit_2.get(a - 1, 0, k - 1);
for(int& i : add){
if(!out[i] && min(range[i].second, b) - max(range[i].first, a) + 1 >= k){
ans++;
}
}
for(int& i : rem){
if(min(range[i].second, b) - max(range[i].first, a) + 1 >= k){
ans--;
}
}
cout << (last_ans = ans) << "\n";
}
}
}
}
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
if(fopen(taskname".inp", "r")){
freopen(taskname".inp", "r", stdin);
}
cin >> n >> t;
if(n <= 5000){
sub1::solve();
}
else{
sub23456::solve();
}
}
