#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 PERIOD = 1500;
const int SIZE = 500;
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<vector<int>>block;
vector<pair<int, int>>range;
vector<int>p;
int N;
void build(vector<pair<int, int>>& r){
range = r;
for(int i = SIZE - 1; i < r.size(); i += SIZE){
block.emplace_back(vector<int>());
for(int j = 0; j < SIZE; j++){
block.back().emplace_back(range[i - j].second);
}
sort(block.back().begin(), block.back().end());
}
}
int get(int P, int l, int r){
int p = 0, ans = 0;
for(int i = 0; i < block.size(); i++){
int j = i * (SIZE + 1) - 1;
if(j >= range.size() || range[j].first > P){
p = j - SIZE + 1;
break;
}
ans += upper_bound(block[i].begin(), block[i].end(), r) - lower_bound(block[i].begin(), block[i].end(), l);
}
while(p < range.size() && range[p].first <= P){
if(l <= range[p].second && r >= range[p].second){
ans++;
}
p++;
}
return ans;
}
};
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;
if(out[i - 1]){
continue;
}
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(min(a + k - 2, b - k + 1), 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();
}
}
