#include "horses.h"
#include <bits/stdc++.h>
#define bupol __builtin_popcount
#define ll long long
#define ld long double
#define fi first
#define se second
#define pb push_back
#define lf (id<<1)
#define rg ((id<<1)|1)
#define md ((l+r)>>1)
using namespace std;
const int MAXN = 2e5+10;
const int MAXK = 2010;
const int LOG = 20;
const int MOD = 1e9+7;
const int SQRT = 520;
const int INF = 1e9+10;
typedef pair<int,int> pii;
typedef pair<int,pii> ipii;
int mul(int x, int y){
ll num = (1ll*x*y)%MOD;
return (int)(num);
}
int n;
int pr[MAXN], ans[MAXN], x[MAXN], y[MAXN], mx;
int init(int N, int X[], int Y[]) {
n = N;
for(int i=1; i<=n; i++) {
x[i] = X[i-1]; y[i] = Y[i-1];
}
pr[0] = 1; mx = -1;
for(int i=1; i<=n; i++){
pr[i] = mul(pr[i-1], x[i]);
ans[i] = mul(pr[i], y[i]);
mx = max(mx, ans[i]);
}
return mx;
}
int updateX(int pos, int val) {
x[pos+1] = val;
pr[0] = 1; mx = -1;
for(int i=1; i<=n; i++){
pr[i] = mul(pr[i-1], x[i]);
ans[i] = mul(pr[i], y[i]);
mx = max(mx, ans[i]);
}
return mx;
}
int updateY(int pos, int val) {
y[pos+1] = val;
pr[0] = 1; mx = -1;
for(int i=1; i<=n; i++){
pr[i] = mul(pr[i-1], x[i]);
ans[i] = mul(pr[i], y[i]);
mx = max(mx, ans[i]);
}
return mx;
}
