#include <bits/stdc++.h>
#include "horses.h"
using namespace std;
#define MOD 1000000007
int ng;
vector<long long> xg;
vector<long long> yg;
long long pref = 1;
long long power(long long n, long long pow, long long m) {if (pow == 0) return 1;if (pow % 2 == 0) {long long x = power(n, pow / 2, m);return (x * x) % m;}else return (power(n, pow - 1, m) * n) % m;}
int init(int n, int* x, int* y)
{
ng = n;
for(int i = 0; i < n; i++)
{
xg.push_back(x[i]);
yg.push_back(y[i]);
}
for(int i = 0; i < ng-32; i++)
{
pref*=xg[i];
pref%=MOD;
}
int stop = 0;
long long p = 1;
for(int i = ng-1; i >= 0; i--)
{
p*=xg[i];
if(p > 1000000000)
{
stop = i;
break;
}
}
p = pref;
for(int i = max(0, ng-32); i < stop; i++)
{
p*=xg[i];
p%=MOD;
}
long long mx = 0;
long long p2 = 1;
for(int i = stop; i < ng; i++)
{
p2*=xg[i];
if(mx < p2*yg[i])
{
mx = p2*yg[i];
}
}
mx%=MOD;
return (int)((mx*p)%MOD);
}
int updateX(int pos, int val)
{
if(pos < ng-32)
{
pref*=power(xg[pos], MOD-2, MOD);
pref%=MOD;
pref*=val;
pref%=MOD;
}
xg[pos] = val;
int stop = 0;
long long p = 1;
for(int i = ng-1; i >= 0; i--)
{
p*=xg[i];
if(p > 1000000000)
{
stop = i;
break;
}
}
p = pref;
for(int i = max(0, ng-32); i < stop; i++)
{
p*=xg[i];
p%=MOD;
}
long long mx = 0;
long long p2 = 1;
for(int i = stop; i < ng; i++)
{
p2*=xg[i];
if(mx < p2*yg[i])
{
mx = p2*yg[i];
}
}
mx%=MOD;
return (int)((mx*p)%MOD);
}
int updateY(int pos, int val)
{
yg[pos] = val;
int stop = 0;
long long p = 1;
for(int i = ng-1; i >= 0; i--)
{
p*=xg[i];
if(p > 1000000000)
{
stop = i;
break;
}
}
p = pref;
for(int i = max(0, ng-32); i < stop; i++)
{
p*=xg[i];
p%=MOD;
}
long long mx = 0;
long long p2 = 1;
for(int i = stop; i < ng; i++)
{
p2*=xg[i];
if(mx < p2*yg[i])
{
mx = p2*yg[i];
}
}
mx%=MOD;
return (int)((mx*p)%MOD);
}
