/*
Author: Nguyen Chi Thanh - High School for the Gifted - VNU.HCM (i2528)
*/
#ifndef NCTHANH
#include "game.h"
#endif
#include <bits/stdc++.h>
using namespace std;
// Copied from sample code
long long gcd2(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
/* START OF TEMPALTE */
// #define int long long
#define ll long long
#define ull unsigned long long
#define ld long double
#define pii pair<int, int>
#define pll pair<ll, ll>
#define fi first
#define se second
#define popcount __builtin_popcountll
#define all(x) (x).begin(), (x).end()
#define BIT(x, i) (((x) >> (i)) & 1)
#define MASK(x) (1ll << (x))
#define SZ(a) ((int32_t)a.size())
#define debug(a, l, r) {for (int _i = (l); _i <= (r); ++_i) cout << (a)[_i] << ' '; cout << '\n';}
template<class X, class Y>
bool minimize(X &x, const Y &y) {
if (x > y) {
x = y;
return true;
} else return false;
}
template<class X, class Y>
bool maximize(X &x, const Y &y) {
if (x < y) {
x = y;
return true;
} else return false;
}
/* END OF TEMPALTE */
const int MAXNODE1D = 1e7 + 5;
const int MAXNODE2D = 2e6 + 5;
int n, m;
struct Node1D {
int leftChild, rightChild;
ll val;
Node1D() : leftChild(0), rightChild(0), val(0) {}
} nodes[MAXNODE1D];
int numNodes1D = 0;
struct SegmentTree1D {
int root;
SegmentTree1D() : root(0) {}
void update(int &id, int l, int r, int pos, ll val) {
if (id == 0) id = ++numNodes1D;
if (l == r) {
nodes[id].val = val;
return;
}
int mid = (l + r) >> 1;
if (pos <= mid) update(nodes[id].leftChild, l, mid, pos, val);
else update(nodes[id].rightChild, mid + 1, r, pos, val);
int left = nodes[id].leftChild, right = nodes[id].rightChild;
nodes[id].val = gcd2(nodes[left].val, nodes[right].val);
}
ll query(int id, int l, int r, int u, int v) {
if (!id || v < l || r < u) return 0ll;
if (u <= l && r <= v) return nodes[id].val;
int mid = (l + r) >> 1;
ll get1 = query(nodes[id].leftChild, l, mid, u, v);
ll get2 = query(nodes[id].rightChild, mid + 1, r, u, v);
return gcd2(get1, get2);
}
};
struct Node2D {
SegmentTree1D seg;
int leftChild, rightChild;
Node2D() : seg(), leftChild(0), rightChild(0) {}
} nodes2D[MAXNODE2D];
int numNodes2D = 0;
struct SegmentTree2D {
int root;
SegmentTree2D() : root(0) {}
void update(int &id, int l, int r, int x, int y, ll val) {
if (id == 0) id = ++numNodes2D;
if (l == r) {
nodes2D[id].seg.update(
nodes2D[id].seg.root, 1, m,
y, val
);
return;
}
int mid = (l + r) >> 1;
if (x <= mid) update(nodes2D[id].leftChild, l, mid, x, y, val);
else update(nodes2D[id].rightChild, mid + 1, r, x, y, val);
ll leftVal = 0;
ll rightVal = 0;
if (nodes2D[id].leftChild) {
leftVal = nodes2D[nodes2D[id].leftChild].seg.query(
nodes2D[nodes2D[id].leftChild].seg.root, 1, m,
y, y
);
}
if (nodes2D[id].rightChild) {
rightVal = nodes2D[nodes2D[id].rightChild].seg.query(
nodes2D[nodes2D[id].rightChild].seg.root, 1, m,
y, y
);
}
nodes2D[id].seg.update(
nodes2D[id].seg.root, 1, m,
y, gcd2(leftVal, rightVal)
);
}
ll query(int id, int l, int r, int x1, int y1, int x2, int y2) {
if (!id || x2 < l || r < x1) return 0ll;
if (x1 <= l && r <= x2) {
return nodes2D[id].seg.query(
nodes2D[id].seg.root, 1, m,
y1, y2
);
}
int mid = (l + r) >> 1;
return gcd2(
query(nodes2D[id].leftChild, l, mid, x1, y1, x2, y2),
query(nodes2D[id].rightChild, mid + 1, r, x1, y1, x2, y2)
);
}
};
SegmentTree2D seg;
void init(int R, int C) {
n = R; m = C;
return;
}
void update(int P, int Q, ll K) {
P++; Q++;
seg.update(seg.root, 1, n, P, Q, K);
return;
}
ll calculate(int P, int Q, int U, int V) {
P++; Q++; U++; V++;
ll ans = seg.query(seg.root, 1, n, P, Q, U, V);
return ans;
}
#ifdef NCTHANH
signed main() {
freopen("input.txt", "r", stdin);
freopen("output.txt", "w", stdout);
ios_base::sync_with_stdio(0);
cin.tie(nullptr); cout.tie(nullptr);
int R, C, Q; cin >> R >> C >> Q;
init(R, C);
while (Q--) {
int type; cin >> type;
if (type == 1) {
int P, Q, K; cin >> P >> Q >> K;
update(P, Q, K);
} else {
int P, Q, U, V;
cin >> P >> Q >> U >> V;
cout << calculate(P, Q, U, V) << '\n';
}
}
return 0;
}
#endif
