#include "horses.h"
#include <bits/stdc++.h>
#define se second
#define fi first
using namespace std;
using ll = long long;
using pi = pair<int,int>;
using vi = vector<int>;
const int MOD = 1e9 + 7;
const int MAX_N = 5e5 + 5;
struct Node {
ll val = 1, X = 1, Y = 1;
} segm[MAX_N];
void updatey(int pos, int l, int r, int x, ll val) {
if(l == r) {
segm[pos].val = (1ll * val * segm[pos].X);
segm[pos].Y = val;
return;
}
int m = (l+r)/2;
if(m >= x) updatey(2*pos+1, l, m, x, val);
else updatey(2*pos+2, m+1, r, x, val);
segm[pos].val = max(1ll * segm[2*pos+1].val, 1ll * segm[2*pos+1].X * segm[2*pos+2].val);
}
void updatex(int pos, int l, int r, int x, ll val) {
if(l > x or r < x) return;
if(l == r) {
segm[pos].val = (1ll * segm[pos].Y * val);
segm[pos].X = val;
return;
}
int m = (l+r)/2;
updatex(2*pos+1, l, m, x, val);
updatex(2*pos+2, m+1, r, x, val);
segm[pos].val = max(1ll * segm[2*pos+1].val, 1ll * segm[2*pos+1].X * segm[2*pos+2].val);
segm[pos].X = (1ll * segm[2*pos+1].X * segm[2*pos+2].X);
}
int N2;
int init(int N, int X[], int Y[]) {
for(int i=0; i<N; ++i) {
updatex(1, 0, N-1, i, (ll)X[i]);
updatey(1, 0, N-1, i, (ll)Y[i]);
}
N2 = N;
return segm[1].val%MOD;
}
int updateX(int pos, int val) {
updatex(1, 0, N2-1, pos, val);
return segm[1].val%MOD;
}
int updateY(int pos, int val) {
updatey(1, 0, N2-1, pos, val);
return segm[1].val%MOD;
}
