#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
const int MAX_N = 500000 + 1;
const int MOD = 1000000007; // 10^9 + 7
int X_store[MAX_N];
int Y_store[MAX_N];
int N_store;
int calc_max_profit() {
long long max_profit = 0;
long long num_horses = 1;
for (int i = 0; i < N_store; i++) {
num_horses = (num_horses * X_store[i]) % MOD;
long long current_profit = (num_horses * Y_store[i]) % MOD;
max_profit = max(max_profit, current_profit);
}
return static_cast<int>(max_profit);
}
int init(int N, int X[], int Y[]) {
N_store = N;
for (int i = 0; i < N; i++) {
X_store[i] = X[i];
Y_store[i] = Y[i];
}
return calc_max_profit();
}
int updateX(int pos, int val) {
X_store[pos] = val;
return calc_max_profit();
}
int updateY(int pos, int val) {
Y_store[pos] = val;
return calc_max_profit();
}
