#include<bits/stdc++.h>
#ifndef SAMI
#include "wombats.h"
#endif
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
using namespace std;
typedef long long int ll;
typedef vector<ll> vi;
typedef vector<vector<ll>> vvi;
typedef pair<ll,ll> pi;
typedef map<ll,ll> mi;
typedef long double ld;
typedef vector<ld> vd;
typedef vector<vector<ld>> vvd;
typedef pair<ld,ld> pd;
#define ff first
#define ss second
#define srt(a) sort(a.begin(),a.end());
#define fip(k, n) for (ll i = k; i < n; i++)
#define fjp(k, n) for (ll j = k; j < n; j++)
#define fin(k, n) for (ll i = k; i >= n; i--)
#define fjn(k, n) for (ll j = k; j >= n; j--)
#define fp(k, n, m) for (ll k = n; k < m; k++)
#define fn(k, n, m) for (ll k = n; k >= m; k--)
#define ordered_set tree<pi, null_type,less< pi >, rb_tree_tag,tree_order_statistics_node_update>
#define totalOne(n) __builtin_popcount(n)
#define backZero(n) __builtin_ctzll(n)
#define frontZero(n) __builtin_clzll(n)
#define fx(k) for ( auto x : k )
#define test ll t;cin >> t;while (t--)
#define nli "\n"
// ==========================(debug)============================================================================================== //
#ifdef SAMI
#define debug(x) cerr<<#x;cerr<<" ";_printn(x);cerr<<nli;
#define debg() cerr<<nli;
#else
#define debug(x)
#define debg()
#endif
void _printn(ll x){ cerr<<x<<" "; }
void _printn(int x){ cerr<<x<<" "; }
void _printn(ld x){ cerr<<x<<" "; }
void _printn(double x){ cerr<<x<<" "; }
void _printn(string x){ cerr<<x<<" "; }
void _printn(char x){ cerr<<x<<" "; }
void _printn(bool x){ cerr<<x<<" "; }
template<class T,class V>void _printn(pair<T,V> vv);
template<class T> void _printn(vector<T> vv);
template<class T> void _printn(set<T> vv);
template<class T,class V> void _printn(map<T,V> vv);
template<class T> void _printn(multiset<T> vv);
template<class T,class V>void _printn(pair<T,V> vv){ cerr<<"( ";_printn(vv.ff);cerr<<",";_printn(vv.ss);cerr<<")";}
template<class T> void _printn(vector<T> vv){ cerr<<"[ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"]"; };
template<class T> void _printn(set<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T> void _printn(multiset<T> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
template<class T,class V> void _printn(map<T,V> vv){ cerr<<"{ "; for(auto xx:vv){ _printn(xx);cerr<<" "; } cerr<<"}"; };
// ==========================(debug)============================================================================================== //
ll n,m,tp,tp2,res,cnt,sum,tptp,ans;
const ll mx = 5e5+5;
const ll mod = 1e9+7;
// ==========================(MOD)=============================================================================================== //
ll mod_add(ll aa,ll bb){ return ((aa%mod)+(bb%mod))%mod; }
ll mod_minus(ll aa,ll bb){ return (((aa%mod)-(bb%mod))+10*mod)%mod; }
ll mod_mul(ll aa,ll bb){ return ((aa%mod)*(bb%mod))%mod; }
ll mod_power(ll aa,ll bb){ aa%=mod; ll empowered = 1; bb%=mod-1; while(bb > 0){ if(bb & 1) empowered = mod_mul(empowered,aa); bb = bb >> 1; aa = mod_mul(aa,aa); } return empowered; }
ll mod_divi(ll aa,ll bb){ aa=mod_mul(aa,mod_power(bb,mod-2)); return aa; }
// ==========================(MOD)=============================================================================================== //
#define ds array<array<int,210>,210>
bool f = false;
ll v[5010][210];
ll h[5010][210];
ll dp[5010][210];
ll opt[210][210];
const ll blk = 10;
typedef struct SEGMENT_TREE{
vector<ds> arr;
ll range,l,r;
void init(ll k){
range = 4*k+5;
arr.resize(range);
return;
}
void merge(ll aa,ll bb,ll cc){
fip(0,m)
fjp(0,m){
arr[aa][i][j] = 1e9;
}
tptp = -m+1;
tp = m-1;
ll i,j;
while(tptp<=m-1){
// j - i = tptp
i = tp;
j = tptp + i;
while(i<=m-1 && j<=m-1){
l = 0;
assert(i>=0 && i<=m-1);
assert(j>=0 && j<=m-1);
if(j) l = opt[i][j-1];
r = m-1;
if(i+1<m) r = opt[i+1][j];
fp(kk,l,r+1)
if(arr[aa][i][j] > arr[bb][i][kk] + arr[cc][kk][j]){
arr[aa][i][j] = arr[bb][i][kk] + arr[cc][kk][j];
opt[i][j] = kk;
}
i++,j++;
}
tp--;
tp = max(tp,0ll);
tptp++;
}
return;
}
void build_block(ll ptr,ll id){
l = id*blk;
r = id*blk + blk;
r = min(n-1,r);
fp(kk,0,m){
fip(l,r+1)
fjp(0,m)
dp[i][j] = 1e9;
dp[l][kk] = 0;
fip(l,r+1){
if(i>l)
fjp(0,m)
dp[i][j] = min(dp[i][j],dp[i-1][j]+v[i-1][j]);
fjp(1,m)
dp[i][j] = min(dp[i][j],dp[i][j-1]+h[i][j-1]);
fjn(m-2,0)
dp[i][j] = min(dp[i][j],dp[i][j+1]+h[i][j]);
}
fjp(0,m)
arr[ptr][kk][j] = dp[r][j];
}
return;
}
void build(ll ptr,ll le,ll re){
if(le==re){
build_block(ptr,le);
return;
}
ll mid = le + (re-le) / 2;
build(2*ptr,le,mid);
build(2*ptr+1,mid+1,re);
merge(ptr,2*ptr,2*ptr+1);
return;
}
void update(ll ptr,ll le,ll re,ll id){
if(le==re && le==id){
cerr<<"here"<<nli;
build_block(ptr,le);
return;
}
if(id > re || id < le)
return;
ll mid = le + (re-le) / 2;
update(2*ptr,le,mid,id);
update(2*ptr+1,mid+1,re,id);
merge(ptr,2*ptr,2*ptr+1);
return;
}
ll query(ll aa,ll bb){
return arr[1][aa][bb];
}
}SGT;
SGT sgt;
void init(int R, int C, int H[5000][200], int V[5000][200]) {
n = R;
m = C;
sum = 0;
fip(0,R)
fjp(0,C-1)
h[i][j] = H[i][j];
fip(0,R-1)
fjp(0,C)
v[i][j] = V[i][j];
sgt.init(((n-1)/blk)+10);
sgt.build(1,0,(n-1)/blk);
return;
}
void changeH(int P, int Q, int W) {
h[P][Q] = W;
if(P/blk)
sgt.update(1,0,(n-1)/blk,(P/blk)-1);
sgt.update(1,0,(n-1)/blk,P/blk);
return;
}
void changeV(int P, int Q, int W) {
v[P][Q] = W;
sgt.update(1,0,(n-1)/blk,P/blk);
return;
}
int escape(int V1, int V2) {
return sgt.query(V1,V2);
}
#ifdef SAMI
static int H[5000][200];
static int V[5000][200];
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
#ifdef SAMI
freopen("input1.txt", "r", stdin);
freopen("output1.txt", "w", stdout);
freopen("error1.txt", "w", stderr);
#endif // ONLINE_JUDGE
int R, C, E, P, Q, W, V1, V2, event, i, j;
int res;
cin>>R>>C;
for (i = 0; i < R; ++i)
for (j = 0; j < C-1; ++j)
cin>>H[i][j];
for (i = 0; i < R-1; ++i)
for (j = 0; j < C; ++j)
cin>>V[i][j];
init(R, C, H, V);
cin>>E;
for (i = 0; i < E; i++) {
cin>>event;
if (event == 1) {
cin>>P>>Q>>W;
changeH(P, Q, W);
} else if (event == 2) {
cin>>P>>Q>>W;
changeV(P, Q, W);
} else if (event == 3) {
cin>>V1>>V2;
printf("%d\n", escape(V1, V2));
} else
cout<<"Invalid event type."<<nli;;
}
// cerr << "Time elapsed: " << setprecision(6) << 1000.0 * clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
#endif
