#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 = 500;
const int INF = 2e9 + 5;
struct Node{
int lc, rc, cnt;
Node(){
lc = rc = -1;
cnt = 0;
}
};
struct PersistentSegmentTree{
vector<Node>st;
vector<int>p, v;
int N;
void init(int id, int l, int r){
if(l == r){
return;
}
int m = (l + r) >> 1;
st[id].lc = st.size();
st.emplace_back(Node());
st[id].rc = st.size();
st.emplace_back(Node());
init(st[id].lc, l, m);
init(st[id].rc, m + 1, r);
}
void update(int id, int l, int r, int x){
st[id].cnt++;
if(l == r){
return;
}
int m = (l + r) >> 1;
if(m < x){
st.emplace_back(st[st[id].rc]);
update(st[id].rc = int(st.size()) - 1, m + 1, r, x);
}
else{
st.emplace_back(st[st[id].lc]);
update(st[id].lc = int(st.size()) - 1, l, m, x);
}
}
void build(vector<pair<int, int>>& range){
if(range.empty()){
N = 0;
return;
}
st.clear();
p.clear();
v.clear();
st.emplace_back(Node());
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){
st.emplace_back(Node());
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();
v.emplace_back(INF);
init(0, 1, N);
for(int i = 0, j = 0; i < range.size(); i++){
if(range[i].first != p[j]){
st[j + 1] = st[j];
j++;
}
update(j, 1, N, lower_bound(v.begin(), v.end(), range[i].second) - v.begin());
}
}
int get_cnt(int id, int l, int r, int u, int v){
if(l > v || r < u){
return 0;
}
if(u <= l && v >= r){
return st[id].cnt;
}
int m = (l + r) >> 1;
return get_cnt(st[id].lc, l, m, u, v) + get_cnt(st[id].rc, m + 1, r, u, v);
}
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;
return get_cnt(upper_bound(p.begin(), p.end(), P) - p.begin() - 1, 1, N, l, r);
}
};
PersistentSegmentTree st_1, st_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>>st_range;
for(int i = 0; i < range.size(); i++){
if(!out[i]){
st_range.emplace_back(range[i]);
}
}
sort(st_range.begin(), st_range.end());
st_1.build(st_range);
for(int i = 0; i < st_range.size(); i++){
st_range[i].second -= st_range[i].first - 1;
}
st_2.build(st_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 = st_1.get(b - k + 1, a + k - 1, INF) - st_2.get(b - k + 1, 0, k - 1) + st_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();
}
}
