#define M 1000000007 typedef struct{ int l,r,m; } N; N ns[1<<17]; int nn; int ds[1<<16]; int ops[1<<16]; void nmul(N*p1,N*p2,N*pd){ if(p1->r<0&&p2->r<0){ pd->l=1ll*p1->l*p2->l%M; pd->r=-1; pd->m=1; } if(p1->r<0&&p2->r>=0){ pd->l=1ll*p1->l*p2->l%M; pd->r=p2->r; pd->m=p2->m; } if(p1->r>=0&&p2->r<0){ pd->l=p1->l; pd->r=1ll*p1->r*p2->l%M; pd->m=p1->m; } if(p1->r>=0&&p2->r>=0){ pd->l=p1->l; pd->r=p2->r; pd->m=(p1->m+1ll*p1->r*p2->l+p2->m)%M; } } void nadd(N*p1,N*p2,N*pd){ if(p1->r<0&&p2->r<0){ pd->l=p1->l; pd->r=p2->l; pd->m=0; } if(p1->r<0&&p2->r>=0){ pd->l=p1->l; pd->r=p2->r; pd->m=(p2->l+p2->m)%M; } if(p1->r>=0&&p2->r<0){ pd->l=p1->l; pd->r=p2->l; pd->m=(p1->r+p1->m)%M; } if(p1->r>=0&&p2->r>=0){ pd->l=p1->l; pd->r=p2->r; pd->m=(0ll+p1->m+p1->r+p2->l+p2->m)%M; } } void mk(int l,int r,int i){ int i1=i*2+1; int i2=i*2+2; if(l==r-1){ // leaf ns[i].l=ds[l]; ns[i].r=-1; ns[i].m=1; }else{ // inter int c=(l+r)/2; mk(l,c,i1); mk(c,r,i2); int op=ops[c]; if(op=='*'){ nmul(ns+i1,ns+i2,ns+i); }else{ nadd(ns+i1,ns+i2,ns+i); } } } void remk(int l,int r,int i,int j){ int i1=i*2+1; int i2=i*2+2; if(l==r-1){ // leaf ns[i].l=ds[l]; ns[i].r=-1; ns[i].m=1; }else{ // inter int c=(l+r)/2; if(j=r){ return ns[i]; } int c=(l+r)/2; if(y<=c){ return f(l,c,i*2+1,x,y); } if(x>=c){ return f(c,r,i*2+2,x,y); } { N nd; N nl=f(l,c,i*2+1,x,y); N nr=f(c,r,i*2+2,x,y); int op=ops[c]; if(op=='*'){ nmul(&nl,&nr,&nd); }else{ nadd(&nl,&nr,&nd); } return nd; } } main(n,q,i,t,x,y){ scanf("%d",&n); scanf("%d",ds+0); for(i=1;i