#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
using i64 = long long;
constexpr int mod = 1e9 + 7;
struct SegmentTree {
int n;
vector<i64> t;
void init(int _n) {
n = _n;
t.assign(4 * n, 1);
}
void update(int id, int tl, int tr, int i, i64 v) {
if (tl == tr) {
t[id] = v;
return;
}
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
if (i <= tm) {
update(x, tl, tm, i, v);
} else {
update(y, tm + 1, tr, i, v);
}
t[id] = t[x] * t[y] % mod;
}
i64 get(int id, int tl, int tr, int l, int r) {
if (r < tl || tr < l) return 1;
if (l <= tl && tr <= r) return t[id];
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
return get(x, tl, tm, l, r) * get(y, tm + 1, tr, l, r) % mod;
}
void update(int i, int v) { update(0, 0, n - 1, i, v); }
i64 get(int l, int r) { return get(0, 0, n - 1, l, r); }
};
int n;
SegmentTree t;
vector<int> x, y;
vector<pair<i64, i64>> b;
set<i64> s;
int pos, ans;
bool is(int l, int r) {
i64 k = y[r];
if (k > y[l]) return true;
auto it = s.upper_bound(l);
while (it != s.end()) {
k *= x[*it];
if (k > y[l]) return true;
it++;
}
return false;
}
int init(int N, int X[], int Y[]) {
n = N;
x.assign(X, X + N);
y.assign(Y, Y + N);
t.init(n);
for (int i = 0; i < n; i++) {
if (x[i] > 1) {
s.insert(i);
}
t.update(i, x[i]);
}
pos = 0;
ans = x[0] * y[0];
for (int i = 1; i < n; i++) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
}
return ans;
}
int updateX(int i, int val) {
if (x[i] > 1) s.erase(i);
if (val > 1) s.insert(i);
t.update(i, val);
x[i] = val;
if (i < pos) {
if (is(i, pos)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
} else if (i > pos) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
} else {
pos = 0;
ans = x[0] * y[0];
for (int i = 1; i < n; i++) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
}
}
return ans;
}
int updateY(int i, int val) {
y[i] = val;
if (i < pos) {
if (is(i, pos)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
} else if (i > pos) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
} else {
pos = 0;
ans = x[0] * y[0];
for (int i = 1; i < n; i++) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, i) * y[i] % mod;
}
}
}
return ans;
}
