#include <iostream>
#include <cstdio>
#include <vector>
#include "game.h"
using namespace std;
typedef long long lli;
struct ppnode0 {
lli ans;
ppnode0 *l, *r;
ppnode0(lli _res = 0ll, ppnode0 *_l = NULL, ppnode0 *_r = NULL)
{
ans = _res, l = _l, r = _r;
}
};
struct ppnode1 {
ppnode0* ans;
ppnode1 *l, *r;
ppnode1(ppnode0* _res = new ppnode0(), ppnode1 *_l = NULL, ppnode1 *_r = NULL)
{
ans = _res, l = _l, r = _r;
}
};
typedef ppnode0* pnode0;
typedef ppnode1* pnode1;
pair<int, int> sz;
pnode1 grid;
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;
}
pnode0 upd0(pnode0 root, int L, int R, int b, lli v)
{
if(!root) root = new ppnode0();
if(L == R) return new ppnode0(v, NULL, NULL);
else
{
pnode0 nw = new ppnode0(0, NULL, NULL);
if(b <= (L+R)/2) nw->l = upd0(root->l, L, (L+R)/2, b, v), nw->r = root->r;
else nw->r = upd0(root->r, (L+R)/2+1, R, b, v), nw->l = root->l;
if(nw->l) nw->ans = gcd2(nw->ans, nw->l->ans);
if(nw->r) nw->ans = gcd2(nw->ans, nw->r->ans);
return nw;
}
}
lli qry0(pnode0 root, int L, int R, int a, int b)
{
if(a > R || b < L || !root) return 0ll;
else if(a <= L && R <= b) return root->ans;
else return gcd2(qry0(root->l, L, (L+R)/2, a, b), qry0(root->r, (L+R)/2+1, R, a, b));
}
pnode1 upd1(pnode1 root, int L, int R, int a, int b, lli v)
{
if(!root) root = new ppnode1();
if(L == R) return new ppnode1(upd0(root->ans, 0, sz.second, b, v), NULL, NULL);
else
{
pnode1 nw = new ppnode1(root->ans, NULL, NULL);
if(a <= (L+R)/2) nw->l = upd1(root->l, L, (L+R)/2, a, b, v), nw->r = root->r;
else nw->r = upd1(root->r, (L+R)/2+1, R, a, b, v), nw->l = root->l;
lli pusher = 0;
if(nw->l) pusher = gcd2(pusher, qry0(nw->l->ans, 0, sz.second, b, b));
if(nw->r) pusher = gcd2(pusher, qry0(nw->r->ans, 0, sz.second, b, b));
nw->ans = upd0(nw->ans, 0, sz.second, b, pusher);
return nw;
}
}
lli qry1(pnode1 root, int L, int R, int a, int b, int c, int d)
{
if(a > R || b < L || !root) return 0ll;
else if(a <= L && R <= b) return qry0(root->ans, 0, sz.second, c, d);
else return gcd2(qry1(root->l, L, (L+R)/2, a, b, c, d), qry1(root->r, (L+R)/2+1, R, a, b, c, d));
}
void init(int _R, int _C) {
sz.first = _R-1, sz.second = _C-1;
grid = NULL;
}
void update(int P, int Q, long long K) {
//cout << "upd\n";
grid = upd1(grid, 0, sz.first, P, Q, K);
}
long long calculate(int P, int Q, int U, int V) {
//cout << "calc\n";
return qry1(grid, 0, sz.first, P, U, Q, V);
}
