#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const int N = 25e4 + 7;
struct Query{
int t, l, r, c;
ll k;
};
struct BIT{
ll d[N];
void update(int x, int val){
for(; x < N; x += x & -x)
d[x] += val;
}
ll get(int x){
ll res = 0;
for(; x > 0; x -= x & -x)
res += d[x];
return res;
}
void updateRange(int l, int r, int val){
update(l, val);
update(r + 1, -val);
}
} bit;
struct SegTree{
int n;
ll d[N * 4], lazyVal[N * 4], lazyMax[N * 4];
void init(int _n){
n = _n;
}
void doLazy(int id, int l, int r){
d[id] += lazyVal[id];
d[id] = max(d[id], lazyMax[id]);
if (l < r){
lazyVal[id << 1] += lazyVal[id];
lazyMax[id << 1] += lazyVal[id];
lazyMax[id << 1] = max(lazyMax[id << 1], lazyMax[id]);
lazyVal[id << 1 | 1] += lazyVal[id];
lazyMax[id << 1 | 1] += lazyVal[id];
lazyMax[id << 1 | 1] = max(lazyMax[id << 1 | 1], lazyMax[id]);
}
lazyVal[id] = lazyMax[id] = 0;
}
void update(int id, int l, int r, int u, int v, int val){
doLazy(id, l, r);
if (v < l || r < u)
return;
if (u <= l && r <= v){
lazyVal[id] += val;
doLazy(id, l, r);
return;
}
int mid = (l + r) >> 1;
update(id << 1, l, mid, u, v, val);
update(id << 1 | 1, mid + 1, r, u, v, val);
}
ll get(int id, int l, int r, int pos){
doLazy(id, l, r);
if (pos < l || r < pos)
return 0;
if (l == r)
return d[id];
int mid = (l + r) >> 1;
return max(get(id << 1, l, mid, pos), get(id << 1 | 1, mid + 1, r, pos));
}
void update(int l, int r, int k){
update(1, 1, n, l, r, k);
}
ll get(int pos){
return get(1, 1, n, pos);
}
} st;
int n, m, q;
Query queries[N];
int main(){
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> m >> q;
for(int i = 1; i <= q; i++){
cin >> queries[i].t;
if (queries[i].t == 1)
cin >> queries[i].l >> queries[i].r >> queries[i].c >> queries[i].k;
else if (queries[i].t == 2)
cin >> queries[i].l >> queries[i].r >> queries[i].k;
else
cin >> queries[i].l >> queries[i].k;
}
st.init(n);
for(int i = 1; i <= q; i++)
if (queries[i].t == 1) {
st.update(queries[i].l, queries[i].r, queries[i].k);
bit.updateRange(queries[i].l, queries[i].r, queries[i].k);
} else if (queries[i].t == 2) {
st.update(queries[i].l, queries[i].r, -queries[i].k);
} else {
if (st.get(queries[i].l) < queries[i].k){
cout << 0 << '\n';
} else {
ll x = bit.get(queries[i].l) - (st.get(queries[i].l) - queries[i].k);
for(int j = 1; j <= q; j++)
if (queries[j].t == 1 && queries[j].l <= queries[i].l && queries[i].l <= queries[j].r){
x -= queries[j].k;
if (x <= 0){
cout << queries[j].c << '\n';
break;
}
}
}
}
return 0;
}
