#include<bits/stdc++.h>
#pragma GCC target("avx2")
#pragma GCC optimization("O3")
#pragma GCC optimization("unroll-loops")
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
using namespace std;
// #define int long long
#define ll long long
#define pb push_back
#define ppb pop_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define fast ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define freopen(x) freopen(x".in","r",stdin);freopen(x".out","w",stdout);
const int N = 250000 + 5;
const int M = 1e3 + 5;
const ll mod = 1e9 + 7;
const ll inf = 1e17;
int n, m, q, typ, l, r, c, k, a, b, pos[N];
vector<int> v[N];
void solve(){
cin >> n >> m >> q;
while(q--){
cin >> typ;
if(typ == 1){
cin >> l >> r >> c >> k;
for(int i = l; i <= r; i++){
for(int j = 1; j <= k; j++){
v[i].pb(c);
}
}
}else if(typ == 2){
cin >> l >> r >> k;
for(int i = l; i <= r; i++){
pos[i] += k;
pos[i] = min(pos[i], int(v[i].size()));
}
}else{
cin >> a >> b;
if(b + pos[a] <= v[a].size()){
cout << v[a][pos[a] + b - 1] << '\n';
}else{
cout << 0 << '\n';
}
}
}
}
main() {
fast
int tt = 1;
// cin >> tt;
while(tt--){
solve();
}
}
