#include "game.h"
#include<bits/stdc++.h>
int m, n;
int gcd(int x, int y)
{
if (y == 0)
return x;
return gcd(y, x % y);
}
struct node1
{
int l, r, sum;
node1 *left, *right;
node1(int _l, int _r)
{
l = _l;
r = _r;
sum = 0;
left = right = NULL;
}
void update(int i, int v)
{
if (r < i || i < l) return;
if (l==r && l==i)
{
sum = v;
return;
}
int mid=(l+r)>>1;
if(left==NULL) left = new node1(l, mid);
if(right==NULL) right = new node1(mid+1, r);
left->update(i, v);
right->update(i, v);
sum = gcd(left->sum, right->sum);
}
int get(int a, int b)
{
if (r < a || b < l) return 0;
if (a <= l && r <= b) return sum;
int mid=(l+r)>>1;
if(left==NULL) left = new node1(l, mid);
if(right==NULL) right = new node1(mid+1, r);
return gcd(left->get(a, b) , right->get(a, b));
}
};
struct node2
{
int l, r, sum;
node2 *left, *right;
node1 *node;
node2(int _l, int _r)
{
l = _l;
r = _r;
sum = 0;
left = right = NULL;
node = new node1(1, n);
}
void update(int x, int y, int val)
{
if (r<x || x<l) return;
node->update(y, val);
if (l==r) return;
int mid=(l+r)>>1;
if(left==NULL) left = new node2(l, mid);
if(right==NULL) right = new node2(mid+1, r);
left->update(x, y, val);
right->update(x, y, val);
}
int get(int x, int y, int u, int v)
{
if (r<x || u<l) return 0;
if (x <= l && r <= u) return node->get(y, v);
int mid=(l+r)>>1;
if(left==NULL) left = new node2(l, mid);
if(right==NULL) right = new node2(mid+1, r);
return gcd(left->get(x, y, u, v) , right->get(x, y, u, v));
}
};
node2* root;
void init(int R, int C)
{
m = R;
n = C;
root = new node2(1, R);
}
void update(int P, int Q, long long K)
{
root->update(P + 1, Q + 1, K);
}
long long calculate(int P, int Q, int U, int V)
{
return root->get(P + 1, U + 1, Q + 1, V + 1);
}
