#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
#pragma GCC optimization("g", on)
#pragma GCC optimization("03")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse,-fgcse-lm")
#pragma GCC optimize("-ftree-pre,-ftree-vrp")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("Ofast,no-stack-protector")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,tune=native")
#pragma GCC optimize("unroll-loops")
#define aboba ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define br break;
#define sp " "
#define en "\n"
#define pb push_back
#define sz size()
#define bg begin()
#define ed end()
#define in insert
#define ss second
#define ff first
#define rbg rbegin()
#define setp(a) cout << fixed; cout << setprecision(a);
#define all(v) v.begin(), v.end()
#define emp empty()
typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> pll;
typedef double db;
typedef tree<
long long,
null_type,
less_equal<long long>,
rb_tree_tag,
tree_order_statistics_node_update> orset;
void freopen(string s) { freopen((s + ".in").c_str(), "r", stdin); freopen((s + ".out").c_str(), "w", stdout); }
ll bp(ll x, ll y, ll z) { ll res = 1; while (y) { if (y & 1) { res = (res * x) % z; y--; } x = (x * x) % z; y >>= 1; } return res; }
// C(n, k) = ((fact[n] * bp(fact[k], mod - 2)) % mod * bp(fact[n - k], mod - 2)) % mod;
ll lcm(ll a, ll b) { return (a / __gcd(a, b)) * b; }
const ll N = 2.5e5 + 11;
const ll inf = 1e18 + 7;
ll tt = 1;
deque<pll> d[N];
ll t[N * 4], u[N * 4];
void push(ll v, ll tl, ll tr) {
if (u[v]) {
t[v] = max(t[v] + (tr - tl + 1) * u[v], 0ll);
if (tl != tr) {
u[v * 2] += u[v];
u[v * 2 + 1] += u[v];
}
}
u[v] = 0;
}
void upd(ll v, ll tl, ll tr, ll l, ll r, ll x) {
push(v, tl, tr);
if (r < tl || tr < l) return;
if (l <= tl && tr <= r) {
u[v] += x;
push(v, tl, tr);
return;
}
push(v, tl, tr);
ll tm = (tl + tr) / 2;
upd(v * 2, tl, tm, l, r, x);
upd(v * 2 + 1, tm + 1, tr, l, r, x);
t[v] = t[v * 2] + t[v * 2 + 1];
}
ll get(ll v, ll tl, ll tr, ll pos) {
push(v, tl, tr);
if (tl == tr) {
return t[v];
}
ll tm = (tl + tr) / 2;
if (pos <= tm) return get(v * 2, tl, tm, pos);
else return get(v * 2 + 1, tm + 1, tr, pos);
}
void solve() {
ll n, m, q; cin >> n >> m >> q;
// if (m == 1) {
// while (q--) {
// ll tp; cin >> tp;
// if (tp == 1) {
// ll l, r, c, k; cin >> l >> r >> c >> k;
// upd(1, 1, n, l, r, k);
// } else if (tp == 2) {
// ll l, r, k; cin >> l >> r >> k;
// upd(1, 1, n, l, r, -k);
// } else {
// ll a, b; cin >> a >> b;
// cout << (get(1, 1, n, a) >= b) << en;
// }
// }
// return;
// }
if (n > 2000) assert(0);
while (q--) {
ll tp; cin >> tp;
if (tp == 1) {
ll l, r, c, k; cin >> l >> r >> c >> k;
for (ll i = l;i <= r;i++) {
ll tm = k;
if (!d[i].emp) {
pll p = d[i].back();
if (p.ff == c) {
tm += p.ss;
d[i].pop_back();
}
}
d[i].pb({c, tm});
}
} else if (tp == 2) {
ll l, r, k; cin >> l >> r >> k;
for (ll i = l;i <= r;i++) {
ll tm = k;
while (tm) {
if (d[i].emp) br;
if (d[i].front().ss > tm) {
ll x = d[i].front().ff, y = d[i].front().ss;
d[i].pop_front();
d[i].push_front({x, y - tm});
tm = 0;
} else {
tm -= d[i].front().ss;
d[i].pop_front();
}
}
}
} else {
ll a, b; cin >> a >> b;
ll tm = b;
for (auto to : d[a]) {
if (to.ss >= tm) {
tm = 0;
cout << to.ff << en;
br;
} else {
tm -= to.ss;
}
}
if (tm != 0) {
cout << 0 << en;
}
}
}
}
int main() {
aboba
//freopen("numbers");
//cin >> tt;
for (int i = 1;i <= tt;i++) {
solve();
}
}
