#include <bits/stdc++.h>
using namespace std;
const int MAX_N = 250'000 + 10;
const int MAX_Q = 250'000 + 10;
struct Query {
int tp, l, r, c, a;
long long k, b;
};
int n, m, q;
Query queries[MAX_Q];
vector<pair<long long, int>> asks[MAX_N];
long long ans[MAX_Q];
namespace Seg1 {
pair<long long, int> tree[4 * MAX_N];
long long lazy[4 * MAX_N];
inline void update(int id) {
tree[id] = max(tree[id << 1], tree[id << 1 | 1]);
tree[id].first += lazy[id];
}
void build(int id = 1, int l = 1, int r = n + 1) {
lazy[id] = 0;
if (r - l == 1) {
tree[id] = {0, l};
} else {
int mid = (l + r) >> 1;
build(id << 1, l, mid);
build(id << 1 | 1, mid, r);
update(id);
}
}
void add(int ql, int qr, long long x, int id = 1, int l = 1, int r = n + 1) {
if (ql <= l && r <= qr) {
tree[id].first += x;
lazy[id] += x;
} else {
int mid = (l + r) >> 1;
if (ql < mid) {
add(ql, qr, x, id << 1, l, mid);
}
if (mid < qr) {
add(ql, qr, x, id << 1 | 1, mid, r);
}
update(id);
}
}
void modify(int i, long long x, int id = 1, int l = 1, int r = n + 1) {
if (r - l == 1) {
tree[id] = {x, l};
} else {
int mid = (l + r) >> 1;
if (i < mid) {
modify(i, x - lazy[id], id << 1, l, mid);
} else {
modify(i, x - lazy[id], id << 1 | 1, mid, r);
}
update(id);
}
}
long long get(int i, int id = 1, int l = 1, int r = n + 1) {
if (r - l == 1) {
return tree[id].first;
}
int mid = (l + r) >> 1;
if (i < mid) {
return lazy[id] + get(i, id << 1, l, mid);
}
return lazy[id] + get(i, id << 1 | 1, mid, r);
}
}
namespace Seg2 {
long long sum_lazy[4 * MAX_N], mx_lazy[4 * MAX_N];
void build() {
fill(mx_lazy, mx_lazy + 4 * MAX_N, -1e17);
}
inline void apply(int id, long long sum, long long mx) {
sum_lazy[id] += sum;
mx_lazy[id] = max(mx_lazy[id] + sum, mx);
}
inline void push_down(int id) {
apply(id << 1, sum_lazy[id], mx_lazy[id]);
apply(id << 1 | 1, sum_lazy[id], mx_lazy[id]);
sum_lazy[id] = 0;
mx_lazy[id] = -1e17;
}
void add(int ql, int qr, long long x, int id = 1, int l = 1, int r = n + 1) {
if (ql <= l && r <= qr) {
sum_lazy[id] += x;
mx_lazy[id] += x;
} else {
int mid = (l + r) >> 1;
push_down(id);
if (ql < mid) {
add(ql, qr, x, id << 1, l, mid);
}
if (mid < qr) {
add(ql, qr, x, id << 1 | 1, mid, r);
}
}
}
void mx(int ql, int qr, long long x, int id = 1, int l = 1, int r = n + 1) {
if (ql <= l && r <= qr) {
mx_lazy[id] = max(mx_lazy[id], x);
} else {
int mid = (l + r) >> 1;
push_down(id);
if (ql < mid) {
mx(ql, qr, x - sum_lazy[id], id << 1, l, mid);
}
if (mid < qr) {
mx(ql, qr, x - sum_lazy[id], id << 1 | 1, mid, r);
}
}
}
long long get(int i, int id = 1, int l = 1, int r = n + 1) {
if (r - l == 1) {
return max(sum_lazy[id], mx_lazy[id]);
}
int mid = (l + r) >> 1;
push_down(id);
if (i < mid) {
return get(i, id << 1, l, mid);
} else {
return get(i, id << 1 | 1, mid, r);
}
}
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr), cout.tie(nullptr);
cin >> n >> m >> q;
Seg1::build();
Seg2::build();
for (int i = 1; i <= q; ++i) {
auto& Q = queries[i];
cin >> Q.tp;
if (Q.tp == 1) {
cin >> Q.l >> Q.r >> Q.c >> Q.k;
Seg1::add(Q.l, Q.r + 1, Q.k);
Seg2::add(Q.l, Q.r + 1, Q.k);
} else if (Q.tp == 2) {
cin >> Q.l >> Q.r >> Q.k;
Seg2::add(Q.l, Q.r + 1, -Q.k);
Seg2::mx(Q.l, Q.r + 1, 0);
} else {
cin >> Q.a >> Q.b;
long long all = Seg1::get(Q.a), curr = Seg2::get(Q.a);
if (Q.b <= curr) {
asks[Q.a].push_back({Q.b + all - curr, i});
}
}
}
Seg1::build();
for (int i = 1; i <= n; ++i) {
if (!asks[i].empty()) {
sort(asks[i].begin(), asks[i].end(), greater<>());
Seg1::modify(i, -asks[i].back().first);
} else {
Seg1::modify(i, -1e18);
}
}
for (int i = 1; i <= q; ++i) {
auto& Q = queries[i];
if (Q.tp == 1) {
Seg1::add(Q.l, Q.r + 1, Q.k);
while (Seg1::tree[1].first >= 0) {
auto [tmp, x] = Seg1::tree[1];
tmp += asks[x].back().first;
ans[asks[x].back().second] = Q.c;
asks[x].pop_back();
if (!asks[x].empty()) {
Seg1::modify(x, tmp - asks[x].back().first);
} else {
Seg1::modify(x, -1e18);
}
}
}
}
for (int i = 1; i <= q; ++i) {
if (queries[i].tp == 3) {
cout << ans[i] << '\n';
}
}
}
