#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll mod = 1e9 + 7;
int n;
vector<ll> C, P;
int solve() {
ll prod = C[n - 1];
int best = n - 1;
long double ldprod = (long double)C[n-1];
for(int i = n - 2; i >= 0; --i) {
prod *= C[i];
ldprod *= C[i];
long double x = ldprod * (long double)P[best];
if(x >= 1.5e18) break;
if(prod * P[best] <= C[i] * P[i]) {
best = i;
prod = C[i];
ldprod = (long double)C[i];
}
}
prod = 1;
for(int i = 0; i <= best; ++i) {
prod *= C[i];
prod %= mod;
}
prod *= P[best];
prod %= mod;
return int(prod % mod);
}
int init(int N, int X[], int Y[]) {
n = N;
C.resize(n);
P.resize(n);
for(int i = 0; i < n; ++i) C[i] = X[i];
for(int i = 0; i < n; ++i) P[i] = Y[i];
return solve();
}
int updateX(int pos, int val) {
C[pos] = val;
return solve();
}
int updateY(int pos, int val) {
P[pos] = val;
return solve();
}
