#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
#include <utility>
using namespace std;
#define all(a) a.begin(), a.end()
#define rep(i,s,e) for(ll i=s;i<e;i++)
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
const ll INF = 1e18;
typedef complex<double> cd;
const double pi = acos(-1);
const ll mod = 1e9 + 7;
const ll mod1 = 1e9 + 9;
const ll mod2 = 998244353;
const ll mac = 31;
const int MAXN = 4e5 + 2;
typedef vector<int> vi;
typedef vector<vi> vvi;
vi x, y;
int n;
int init(int N, int X[], int Y[]) {
n = N;
x.resize(n);
y.resize(n);
rep(i, 0, n) x[i] = X[i], y[i] = Y[i];
ll ans = 1, cef = 1;
rep(i, 0, n) {
cef *= x[i];
cef %= mod;
ans = max(ans, (cef * y[i])%mod);
}
return ans;
}
int updateX(int pos, int val) {
x[pos] = val;
ll ans = 1, cef = 1;
rep(i, 0, n) {
cef *= x[i];
cef %= mod;
ans = max(ans, (cef * y[i]) % mod);
}
return ans;
}
int updateY(int pos, int val) {
y[pos] = val;
ll ans = 1, cef = 1;
rep(i, 0, n) {
cef *= x[i];
cef %= mod;
ans = max(ans, (cef * y[i]) % mod);
}
return ans;
}
/*
int main() {
int n, q;
cin >> n >> q;
vector<int>x(n), y(n);
rep(i, 0, n)
cin >> x[i];
rep(i, 0, n)
cin >> y[i];
cout<<
while (q--) {
int t, pos, val;
cin >> t >> pos >> val
if (t == 1) {
cout<<
}
else {
}
}
}*/
