#include<bits/stdc++.h>
#include "horses.h"
#define ll long long
#define ff first
#define ss second
#define mxn 500002
#define pb push_back
#define yes cout<<"YES"<<endl
#define no cout<<"NO"<<endl
using namespace std;
ll n,x[mxn],y[mxn],mod=1e9+7,p[mxn];
int init(int n, int X[], int Y[]){
ll ans=0;
for(int i=0;i<n;i++){
ll hn=1;
for(int j=0;j<=i;j++){
hn=(hn*X[j])%mod;
}
ans=max(ans,(hn*y[i])%mod);
}
return ans;
}
int updateX(int pos, int val){
return 0;
}
int updateY(int pos, int val){
return 0;
}
