#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pll pair<ll,ll>
#define fs first
#define sc second
const ll mod = 1e9+7;
const ll mxn = 1010;
const ll inf = 1e9+10;
ll pref[mxn];
ll N;
ll arr[mxn],brr[mxn];
struct SEG{
#define ls now*2+1
#define rs now*2+2
#define mid ((l+r)>>1)
ll seg[mxn*4];
void build(int now,int l,int r){
if(l == r){
seg[now] = arr[l];
return;
}
build(ls,l,mid);
build(rs,mid+1,r);
seg[now] = seg[ls]*seg[rs];
if(seg[now]>=mod)seg[now] = mod+seg[now]%mod;
return;
}
void modify(int now,int l,int r,int p,ll v){
if(l == r){
seg[now] = v;
return;
}
if(mid>=p)modify(ls,l,mid,p,v);
else modify(rs,mid+1,r,p,v);
seg[now] = seg[ls]*seg[rs];
if(seg[now]>=mod)seg[now] = mod+seg[now]%mod;
}
ll getval(int now,int l,int r,int s,int e){
if(l>=s&&e>=r)return seg[now];
if(mid>=e)return getval(ls,l,mid,s,e);
else if(mid<s)return getval(rs,mid+1,r,s,e);
else{
auto re = getval(ls,l,mid,s,e)*getval(rs,mid+1,r,s,e);
if(re>=mod)return mod+re%mod;
else return re;
}
}
#undef ls
#undef rs
#undef mid
};
SEG seg;
bool cmp(int a,int b){
if(a>b)return brr[a]*seg.getval(0,0,N-1,b+1,a)<brr[b];
else return brr[a]<brr[b]*seg.getval(0,0,N-1,a+1,b);
}
ll getans(){
vector<int> v(N);
iota(v.begin(),v.end(),0);
sort(v.begin(),v.end(),cmp);
return seg.getval(0,0,N-1,0,v.back())*brr[v.back()]%mod;
}
int init(int NN, int X[], int Y[]) {
N = NN;
for(int i = 0;i<N;i++){
arr[i] = X[i];
brr[i] = Y[i];
}
seg.build(0,0,N-1);
return getans();
}
int updateX(int pos, int val) {
seg.modify(0,0,N-1,pos,arr[pos]=val);
return getans();
}
int updateY(int pos, int val) {
brr[pos] = val;
return getans();
}
