/* Date: 2017/01/18 00:08:56 Wednesday */ #include using namespace std; #define X first #define Y second #define mp make_pair #define pb push_back #define rep(i,a,n) for(int i=(a);i<=(n);++i) #define dep(i,a,n) for(int i=(a);i>=(n);--i) #define eps 1e-8 #define pi 3.1415926535897 #define sqr(x) ((x)*(x)) #define MAX(a,b) a=max(a,b) #define MIN(a,b) a=min(a,b) #define SZ(x) ((int)(x).size()) #define CPY(a,b) memcpy(a,b,sizeof(a)) #define CLR(a) memset(a,0,sizeof(a)) #define POSIN(x,y) (1<=(x)&&(x)<=n&&1<=(y)&&(y)<=m) #define all(x) (x).begin(),(x).end() #define COUT(S,x) cout< pii; typedef pair pll; typedef pair pff; typedef complex CD; const int inf=0x3f3f3f3f; const int mo=1000000007; inline void gn(long long&x){ int sg=1;char c;while(((c=getchar())<'0'||c>'9')&&c!='-');c=='-'?(sg=-1,x=0):(x=c-'0'); while((c=getchar())>='0'&&c<='9')x=x*10+c-'0';x*=sg; } inline void gn(int&x){long long t;gn(t);x=t;} inline void gn(unsigned long long&x){long long t;gn(t);x=t;} inline void gn(double&x){double t;scanf("%lf",&t);x=t;} inline void gn(long double&x){double t;scanf("%lf",&t);x=t;} templateinline void gn(T1&r,T2&s){gn(r),gn(s);} templateinline void gn(T1&r,T2&s,T3&t){gn(r),gn(s),gn(t);} templateinline void gn(T1&r,T2&s,T3&t,T4&u){gn(r),gn(s),gn(t),gn(u);} inline void gs(char *s){scanf("%s",s);} inline void gc(char &c){while((c=getchar())>126 || c<33);} inline void pc(char c){putchar(c);} const int DX[]={1,0,-1,0},DY[]={0,1,0,-1}; ll powmod(ll a,ll b) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;} ll powmod(ll a,ll b,ll mo) {ll res=1;a%=mo;for(;b;b>>=1){if(b&1)res=res*a%mo;a=a*a%mo;}return res;} ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;} //******************************************* const int N=111111,M=11111111; int l,m,n,t,A,B,opr,x,y; int C[N]; int a[N]; int T[M]; //(a,b)==(A,B)-->a/A=b/B-->a*B-b*A=0 //(a,b,c)==(A,B)-->a/A=(b-c/B*A)/B=b/B-c/B/B*A-->B*B*a-A*B*b+A*A*c=0 void modi(int x,int l,int r,int p,int v){ T[x]=(T[x]+1ll*v*C[p-l])%mo; if(l==r)return; int mid=l+r>>1; if(p<=mid)modi(x<<1,l,mid,p,v); else modi(x<<1|1,mid+1,r,p,v); } int que(int x,int l,int r,int L,int R){ if(L<=l&&r<=R)return T[x]; int mid=l+r>>1,ans=0; if(L<=mid&&mid