#include <bits/stdc++.h>
using namespace std;
#define dbgv(v) cout<<#v<<" = "; f(i,0,v.size()) cout<<v[i]<<" "; cout<<endl
#define dbga(a,x,y) cout<<#a<<" = "; f(i,x,y) cout<<a[i]<<" "; cout<<endl
#define erorp(x) cout<<#x<<"={"<<(x.F)<<" , "<<x.S<<"}"<<endl
#define eror(x) cout<<#x<<'='<<(x)<<endl
#define f_(i,a,b) for(int i=a;i>=b;i--)
#define f(i,a,b) for(int i=a;i<b;i++)
#define nb(x) __builtin_popcount(x)
#define all(v) v.begin(),v.end()
#define bit(n,k) (((n)>>(k))&1)
#define Add(x,y) x=(x+y)%mod
#define maxm(a,b) a=max(a,b)
#define minm(a,b) a=min(a,b)
#define lst(x) x[x.size()-1]
#define sz(x) int(x.size())
#define mp make_pair
#define ll long long
#define pb push_back
#define S second
#define F first
#define int ll
const int N=3e5+99,inf=1e15;
int n,m,q,a[N],b[N],c[N],k[N],type[N],ans[N],seg[2][N<<2],lazy[2][N<<2];
vector<int> ad[N],dl[N],Q[N];
void shift(int ,int ,int ,int );
void add(int L,int R,int val,int s,int id=1,int l=1,int r=q+1){
if(r<=L || R<=l) return ;
if(L<=l && r<=R){
seg[s][id]+=val;
lazy[s][id]+=val;
return ;
}
int mid=(l+r)>>1;
shift(id,l,r,s);
add(L,R,val,s,id<<1,l,mid);
add(L,R,val,s,id<<1|1,mid,r);
seg[s][id]=min(seg[s][id<<1],seg[s][id<<1|1]);
}
int query(int L,int R,int s,int id=1,int l=1,int r=q+1){
if(r<=L || R<=l) return inf;
if(L<=l && r<=R){
return seg[s][id];
}
int mid=(l+r)>>1;
shift(id,l,r,s);
return min(query(L,R,s,id<<1,l,mid),query(L,R,s,id<<1|1,mid,r));
}
inline void shift(int id,int l,int r,int s){
int mid=(l+r)>>1;
lazy[s][id<<1]+=lazy[s][id];
lazy[s][id<<1|1]+=lazy[s][id];
seg[s][id<<1]+=lazy[s][id];
seg[s][id<<1|1]+=lazy[s][id];
lazy[s][id]=0;
}
int pur(int x,int id=1,int l=1,int r=q+1){
if(l+1==r){
return l;
}
int mid=(l+r)>>1;
shift(id,l,r,1);
if(-(seg[1][id<<1])<x) return pur(x,id<<1|1,mid,r);
return pur(x,id<<1,l,mid);
}
main(){
ios::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
cin>>n>>m>>q;
f(i,1,q+1){
cin>>type[i];
if(type[i]==1){
cin>>a[i]>>b[i]>>c[i]>>k[i];
ad[a[i]].pb(i);
dl[b[i]].pb(i);
}
if(type[i]==2){
cin>>a[i]>>b[i]>>k[i];
ad[a[i]].pb(i);
dl[b[i]].pb(i);
}
if(type[i]==3){
cin>>a[i]>>b[i];
Q[a[i]].pb(i);
}
}
f(i,1,n+1){
for(auto x : ad[i]){
if(type[x]==1){
add(x,q+1,k[x],0);
add(x,q+1,-k[x],1);
}
if(type[x]==2){
add(x,q+1,-k[x],0);
}
}
for(auto x : Q[i]){
int res=query(x,x+1,0)-min(0ll,query(1,x+1,0)),cnt=(-query(x,x+1,1))-res+b[x];
if(b[x]>res){
ans[x]=0;
continue ;
}
ans[x]=pur(cnt);
}
for(auto x : dl[i]){
if(type[x]==1){
add(x,q+1,-k[x],0);
add(x,q+1,k[x],1);
}
if(type[x]==2){
add(x,q+1,k[x],0);
}
}
}
f(i,1,q+1){
if(type[i]==3){
cout<<c[ans[i]]<<" ";
}
}
}
