#include "horses.h"
#include <bits/stdc++.h>
#define ll long long
#define ull unsigned ll
#define f first
#define s second
#define pii pair<int,int>
#define pll pair<ll,ll>
#define pb push_back
#define epb emplace_back
const int nmax = 1000001;
const ll mod = 1e9 + 7;
struct node{
double sum, mx = 0;
ll ans;
ll x;
node(){
sum = mx = 0;
ans = 1;
x = 1;
}
}t[4 * nmax];
ll x[nmax], y[nmax];
node merg(node a, node b){
node c;
c.sum = a.sum + b.sum;
c.x = a.x * b.x % mod;
if(a.mx > a.sum + b.mx){
c.mx = a.mx;
c.ans = a.ans;
}
else{
c.mx = a.sum + b.mx;
c.ans = b.ans * a.x % mod;
}
return c;
}
void build(int v, int l, int r){
if(l == r){
t[v].sum = log2(x[l]);
t[v].mx = log2(x[l]) + log2(y[l]);
t[v].ans = x[l] * y[l] % mod;
t[v].x = x[l];
return;
}
int m = (l + r) / 2;
build(2 * v, l, m);
build(2 * v+ 1, m + 1, r);
t[v] = merg(t[2 * v], t[2 * v + 1]);
}
void update(int v, int l, int r, int pos, int val, int ind){
if(l > pos || r < pos)
return;
if(l == r){
if(ind == 0) x[l] = val;
else y[l] = val;
t[v].sum = log2(x[l]);
t[v].mx = log2(x[l]) + log2(y[l]);
t[v].ans = x[l] * y[l] % mod;
t[v].x = x[l];
return;
}
int m = (l + r) / 2;
update(2 * v, l, m, pos, val, ind);
update(2 * v+ 1, m + 1, r, pos, val, ind);
t[v] = merg(t[2 * v], t[2 * v + 1]);
}
int n;
int init(int N, int X[], int Y[]) {
n = N;
for(int i = 0; i < N; ++i){
x[i] = X[i], y[i] = Y[i];
}
build(1, 0, n - 1);
return t[1].ans;
}
int updateX(int pos, int val) {
update(1, 0, n - 1, pos, val, 0);
return t[1].ans;
}
int updateY(int pos, int val) {
update(1, 0, n - 1, pos, val, 1);
return t[1].ans;
}
