#include "horses.h"
#include <bits/stdc++.h>
using namespace std;
#define ll long long
const ll nx=5e5+5, mod=1e9+7, mx=(ll)INT_MAX+1;
int n;
vector<ll> x, y;
struct segtree
{
struct node
{
ll pre, suf, sm, ans, p;
} d[4*nx];
ll a[nx], b[nx];
void update(int l, int r, int i, int idx, ll vx, ll vy)
{
if (r<idx||idx<l) return;
if (l==r)
{
d[i].ans=(vx*vy)%mod;
d[i].pre=d[i].sm=vx;
d[i].suf=1; d[i].p=vy;
return;
}
int md=(l+r)/2;
update(l, md, 2*i, idx, vx, vy);
update(md+1, r, 2*i+1, idx, vx, vy);
if (d[2*i].p<min(d[2*i].suf*d[2*i+1].pre, mx)*d[2*i+1].p)
{
d[i].ans=(d[2*i].sm*d[2*i+1].ans)%mod;
d[i].pre=min(d[2*i].sm*d[2*i+1].pre, mx);
d[i].sm=min(d[2*i].sm*d[2*i+1].sm, mx);
d[i].suf=d[2*i+1].suf;
d[i].p=d[2*i+1].p;
}
else
{
d[i].ans=d[2*i].ans;
d[i].pre=d[2*i].pre;
d[i].sm=min(d[2*i].sm*d[2*i+1].sm, mx);
d[i].suf=min(d[2*i].suf*d[2*i+1].sm, mx);
d[i].p=d[2*i].p;
}
}
} s;
int init(int N, int X[], int Y[]) {
n=N;
x.resize(N+1); y.resize(N+1);
for (int i=1; i<=N; i++) x[i]=X[i-1], y[i]=Y[i-1], s.update(1, n, 1, i, x[i], y[i]);
return (int)s.d[1].ans;
}
int updateX(int pos, int val) {
x[pos+1]=val;
s.update(1, n, 1, pos+1, x[pos+1], y[pos+1]);
return (int)s.d[1].ans;
}
int updateY(int pos, int val) {
y[pos+1]=val;
s.update(1, n, 1, pos+1, x[pos+1], y[pos+1]);
return (int)s.d[1].ans;
}
