#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); }
};
struct mxSegmentTree {
int n;
vector<int> t;
void init(int _n) {
n = _n;
t.resize(4 * n);
}
int merge(int x, int y) {
return max(x, y);
}
void update(int id, int tl, int tr, int i, int 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] = merge(t[x], t[y]);
}
i64 get(int id, int tl, int tr, int l, int r) {
if (r < tl || tr < l) return 0LL;
if (l <= tl && tr <= r) return t[id];
int x = (id << 1) + 1, y = x + 1, tm = (tl + tr) >> 1;
return merge(get(x, tl, tm, l, r), get(y, tm + 1, tr, l, r));
}
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;
mxSegmentTree mx;
vector<int> x, y;
set<int> s;
vector<pair<int, int>> b;
bool is(int tl, int tr) {
auto [l, to] = b[tl];
auto [r, k] = b[tr];
// cout << l << ' ' << to << '\n';
// cout << r << ' ' << k << '\n';
for (int i = l + 1; i <= r; i++) {
k *= x[i];
if (k > y[l]) {
return true;
}
}
return false;
}
int solve() {
auto it = s.end();
b.clear();
int nxt = n;
while (b.size() < 40 && it != s.begin()) {
if (it == s.end()) {
nxt = n;
} else {
nxt = *it;
}
--it;
b.push_back({*it, mx.get(*it, nxt - 1)});
}
if (b.empty()) {
return ranges::max(y);
}
ranges::reverse(b);
int pos = 0;
i64 ans = t.get(0, b[0].first) * b[0].second % mod;
for (int i = 0; i < b.size(); i++) {
if (is(pos, i)) {
pos = i;
ans = t.get(0, b[i].first) * b[i].second % mod;
}
}
return ans;
}
int init(int N, int X[], int Y[]) {
n = N;
x.assign(X, X + N);
y.assign(Y, Y + N);
t.init(n);
mx.init(n);
for (int i = 0; i < n; i++) {
if (x[i] > 1) {
s.insert(i);
}
mx.update(i, y[i]);
t.update(i, x[i]);
}
return solve();
}
int updateX(int pos, int val) {
if (x[pos] > 1) s.erase(pos);
if (val > 1) s.insert(pos);
t.update(pos, val);
x[pos] = val;
return solve();
}
int updateY(int pos, int val) {
mx.update(pos, val);
y[pos] = val;
return solve();
}
