#include "game.h"
#include <iostream>
#include <string>
#include <vector>
#include <cmath>
#include <queue>
#include <set>
#include <cassert>
#include <algorithm>
using namespace std;
typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define pb push_back
#define _1 first
#define _2 second
#define INF 1145141919
#define MOD 1000000007
long long gcd(long long X, long long Y) {
long long tmp;
while (X != Y && Y != 0) {
tmp = X;
X = Y;
Y = tmp % Y;
}
return X;
}
//const int MAX_R = 2000;
//const int MAX_C = 100000;
const int MAX_R = 1000000000;
const int MAX_C = 1000000000;
const int MAX_N2 = MAX_R+1;
const long long MAX_N = 1LL*(MAX_R+1)*(MAX_C+1);
struct SegTree {
SegTree *lch, *rch;
long long val;
SegTree() : val(0), lch(NULL), rch(NULL) {
}
void update(long long x, long long v, long long l=0, long long r=MAX_N) {
if (r-l == 1) {
val = v;
return;
}
if (x < (l+r)/2) {
if (lch == NULL) lch = new SegTree();
lch->update(x, v, l, (l+r)/2);
}
else {
if (rch == NULL) rch = new SegTree();
rch->update(x, v, (l+r)/2, r);
}
val = gcd(lch?lch->val:0, rch?rch->val:0);
}
long long query(long long a, long long b, long long l=0, long long r=MAX_N) {
if (b <= l || r <= a) return 0;
if (a <= l && r <= b) return val;
return gcd(lch?lch->query(a, b, l, (l+r)/2):0,
rch?rch->query(a, b, (l+r)/2, r):0);
}
};
struct SegTree2 {
SegTree2 *lch, *rch;
SegTree val;
SegTree2() : lch(NULL), rch(NULL) {
}
void update(int x, int y, long long v, int l=0, int r=MAX_N2) {
val.update(1LL*MAX_N2*y+x, v);
if (r-l == 1) return;
if (x < (l+r)/2) {
if (lch == NULL) lch = new SegTree2();
lch->update(x, y, v, l, (l+r)/2);
}
else {
if (rch == NULL) rch = new SegTree2();
rch->update(x, y, v, (l+r)/2, r);
}
}
long long query(int a, int b, int ql, int qr, int l=0, int r=MAX_N2) {
if (b <= l || r <= a) return 0;
if (a <= l && r <= b) return val.query(1LL*MAX_N2*ql, 1LL*MAX_N2*qr);
return gcd(lch?lch->query(a, b, ql, qr, l, (l+r)/2):0,
rch?rch->query(a, b, ql, qr, (l+r)/2, r):0);
}
};
SegTree2 root;
void init(int R, int C) {
}
void update(int P, int Q, long long K) {
root.update(P, Q, K);
}
long long calculate(int P, int Q, int U, int V) {
return root.query(P, U+1, Q, V+1);
}
