#include <bits/stdc++.h>
#ifdef NON_SUBMIT
#define TEST(n) (n)
#define tout cerr
#else
#define TEST(n) ((void)0)
#define tout cin
#endif
using namespace std;
struct Seg
{
long long m, sm, lz, slz;
Seg() : m(0), sm(0x7fffffffffffffffLL), lz(0), slz(-0x7fffffffffffffffLL) {}
Seg &operator =(const Seg &a) {
m=a.m;
sm=a.sm;
return *this;
}
};
const int SZ=1<<18;
const long long MAX=0x7fffffffffffffffLL;
Seg tree[2*SZ];
vector<tuple<int,int,long long>> L[2*SZ];
void update(int s, int e, int q, int c, int k)
{
for(s+=SZ,e+=SZ;s<=e;s>>=1,e>>=1) {
if(s&1) {
L[s].emplace_back(q,c,get<2>(L[s].back())+k);
s++;
}
if(~e&1) {
L[e].emplace_back(q,c,get<2>(L[e].back())+k);
e--;
}
}
}
Seg combine(const Seg &a, const Seg &b)
{
Seg c;
c.m=min(a.m,b.m);
if(c.m<max(a.m,b.m)) c.sm=max(a.m,b.m);
if(c.m<a.sm) c.sm=min(c.sm,a.sm);
if(c.m<b.sm) c.sm=min(c.sm,b.sm);
return c;
}
void lazy_propagation(int bit, int s, int e)
{
if(tree[bit].slz!=-MAX) {
if(s<e) {
if(max(tree[2*bit].slz,tree[2*bit].m)+tree[2*bit].lz==tree[bit].m) tree[2*bit].slz=tree[bit].slz-tree[2*bit].lz;
if(max(tree[2*bit+1].slz,tree[2*bit+1].m)+tree[2*bit+1].lz==tree[bit].m) tree[2*bit+1].slz=tree[bit].slz-tree[2*bit+1].lz;
}
tree[bit].m=tree[bit].slz;
tree[bit].slz=-MAX;
}
tree[bit].m+=tree[bit].lz;
if(tree[bit].sm<MAX) tree[bit].sm+=tree[bit].lz;
if(s<e) {
tree[2*bit].lz+=tree[bit].lz;
tree[2*bit+1].lz+=tree[bit].lz;
}
tree[bit].lz=0;
}
void add_tree(int n1, int n2, int v, int bit=1, int s=0, int e=SZ-1)
{
int m=(s+e)>>1;
lazy_propagation(bit,s,e);
if(n2<n1 || n2<s || e<n1) return;
if(n1<=s && e<=n2) {
tree[bit].lz=v;
lazy_propagation(bit,s,e);
return;
}
add_tree(n1,n2,v,2*bit,s,m);
add_tree(n1,n2,v,2*bit+1,m+1,e);
tree[bit]=combine(tree[2*bit],tree[2*bit+1]);
}
void set_tree(int n1, int n2, int bit=1, int s=0, int e=SZ-1)
{
int m=(s+e)>>1;
lazy_propagation(bit,s,e);
if(n2<n1 || n2<s || e<n1 || tree[bit].m>=0) return;
if(n1<=s && e<=n2 && tree[bit].sm>0) {
tree[bit].slz=0;
lazy_propagation(bit,s,e);
return;
}
set_tree(n1,n2,2*bit,s,m);
set_tree(n1,n2,2*bit+1,m+1,e);
tree[bit]=combine(tree[2*bit],tree[2*bit+1]);
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(NULL); cout.tie(NULL);
TEST(freopen("input.txt","r",stdin));
TEST(freopen("output.txt","w",stdout));
TEST(freopen("debug.txt","w",stderr));
int N, M, Q;
cin>>N>>M>>Q;
for(int i=2*SZ;--i;) L[i].emplace_back(0,0,0);
for(int i=1;i<=Q;i++) {
int t, a, c, d;
long long b;
cin>>t>>a>>b; --a;
if(t==1) {
cin>>c>>d;
update(a,--b,i,c,d);
add_tree(a,b,d);
}
else if(t==2) {
cin>>c;
add_tree(a,--b,-c);
set_tree(a,b);
}
else {
long long tot;
int n=1, s=0, e=SZ-1;
while(s<e) {
int m=(s+e)>>1;
lazy_propagation(n,s,e);
if(a<=m) tie(n,e)=make_pair(2*n,m);
else tie(n,s)=make_pair(2*n+1,m+1);
}
lazy_propagation(n,s,e);
if(tree[n].m<b) {
cout<<"0\n";
continue;
}
for(tot=get<2>(L[n=SZ+a].back());n>>=1;) tot+=get<2>(L[n].back());
b+=tot-tree[SZ+a].m;
s=1; e=i-1;
while(s<=e) {
int m=(s+e)>>1; tot=0; n=SZ+a;
for(;;) {
tot+=get<2>(*--upper_bound(L[n].begin(),L[n].end(),make_tuple(m,0,0)));
if(!(n>>=1)) break;
}
if(tot<b) s=m+1;
else e=m-1;
}
n=SZ+a; e=tot=0;
for(;;) {
auto v=*--upper_bound(L[n].begin(),L[n].end(),make_tuple(s,0,0));
if(get<0>(v)>tot) {
tot=get<0>(v);
e=get<1>(v);
}
if(!(n>>=1)) break;
}
cout<<e<<'\n';
}
}
return 0;
}
