#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
typedef vector<ll> vll;
typedef vector <pair<ll, ll>> vp;
typedef pair<ll, ll> pll;
typedef map <ll, ll> mll;
typedef set <ll> sll;
#define pb push_back
#define ff first
#define ss second
#define all(x) (x).begin(), (x).end()
#define print(x) for (auto i : x) cout << i << ' '; cout << '\n';
#define FastIO ios_base::sync_with_stdio(false); cin.tie(NULL);
const ll maxn = 250000+5;
const ll mod = 1e9+7;
const ll inf = 2e18;
ll pw(ll a, ll b, ll M = mod) {ll ans = 1; for (; b; a = ((a * a) % M), b >>= 1) if (b & 1) ans = (ans * a) % M; return ans;}
ll n, m, q, d[maxn];
vp vct[maxn];
int main() {
FastIO
cin >> n >> m >> q;
while (q--) {
ll t, l, r, c, k, a, b;
cin >> t;
if (t == 1) {
cin >> l >> r >> c >> k;
for (ll i = l; i <= r; i++) {
if (vct[i].empty()) vct[i].pb({k, c});
else vct[i].pb({vct[i].back().ff+k, c});
}
} else if (t == 2) {
cin >> l >> r >> k;
for (ll i = l; i <= r; i++) {
if (vct[i].empty()) d[i] = 0;
else {
if (d[i]+k >= vct[i].back().ff) d[i] = vct[i].back().ff;
else d[i]+=k;
}
}
} else {
cin >> a >> b;
b += d[a];
if (vct[a].empty() || vct[a].back().ff < b) cout << 0 << '\n';
else {
ll ind = lower_bound(all(vct[a]), (pll){b, 0}) - vct[a].begin();
cout << vct[a][ind].ss << '\n';
}
}
}
return 0;
}
