#include "game.h"
//Billions of bilious blue blistering barnacles in a thundering typhoon!
#pragma GCC optimize("Ofast,fast-math,unroll-loops")
#pragma GCC target("avx2,fma")
#include<bits/stdc++.h>
#define fast ios::sync_with_stdio(0) , cin.tie(0)
#define F first
#define S second
#define pb push_back
#define vll vector< ll >
#define vi vector< int >
#define pll pair< ll , ll >
#define pi pair< int , int >
#define all(s) s.begin() , s.end()
#define sz(s) s.size()
#define str string
#define md ((s + e) / 2)
#define mid ((l + r) / 2)
#define msdp(dp) memset(dp , -1 , sizeof dp)
#define mscl(dp) memset(dp , 0 , sizeof dp)
#define C continue
#define R return
#define B break
#define lx node * 2
#define rx node * 2 + 1
#define br(dosomething) {dosomething; break;}
#define co(dosomething) {dosomething ; continue;}
using namespace std;
typedef long long ll;
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;
}
ll n , m , k ;
void init(int r, int c) {
n = r , m = c ;
}
pair < pll , ll > a[10005] ;
void update(int P, int Q, long long K) {
for(ll j = 0 ; j < k ; j++){
if(a[j].F.F == P && a[j].F.S == Q)R void(a[j].S = K) ;
}
a[k++] = {{P , Q} , K} ;
}
long long calculate(int P, int Q, int U, int V) {
ll ret = 0 ;
for(int j = 0 ; j < k ; j++){
if(a[j].F.F >= P && a[j].F.F <= U && a[j].F.S >= Q && a[j].F.S <= V)ret = gcd2(ret , a[j].S) ;
}
R ret ;
}
