#include <assert.h>

#define M 1000000007

typedef struct{
	int l,r,m;
} N;

N ns[1<<17];
int ds[1<<17];

void nmul(N*p1,N*p2,N*pd){
	if(p1->r<0){
		pd->l=1ll*p1->l*p2->l%M;
		if(p2->r<0){
			pd->r=-1;
			pd->m=1;
		}else{
			pd->r=p2->r;
			pd->m=p2->m;
		}
	}else{
		pd->l=p1->l;
		if(p2->r<0){
			pd->r=1ll*p1->r*p2->l%M;
			pd->m=p1->m;
		}else{
			pd->r=p2->r;
			pd->m=(p1->m+1ll*p1->r*p2->l+p2->m)%M;
		}
	}
}

void nadd(N*p1,N*p2,N*pd){
	pd->l=p1->l;
	if(p2->r<0){
		pd->r=p2->l;
		if(p1->r<0&&p2->r<0){
			pd->m=0;
		}else{
			pd->m=(p1->r+p1->m)%M;
		}
	}else{
		pd->r=p2->r;
		if(p1->r<0){
			pd->m=(p2->l+p2->m)%M;
		}else{
			pd->m=(0ll+p1->m+p1->r+p2->l+p2->m)%M;
		}
	}
}

void ncalc(N*p1,N*p2,N*pd,int op){
	(op=='*'?nmul:nadd)(p1,p2,pd);
}

void mk(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*2];
		ns[i].r=-1;
		ns[i].m=1;
	}else{
		// inter
		int c=(l+r)/2;
		if(j<0||j<c)mk(l,c,i1,j);
		if(j<0||j>=c)mk(c,r,i2,j);
		ncalc(ns+i1,ns+i2,ns+i,ds[l+r-1]);
	}
}

N f(int l,int r,int i,int x,int y){
	if(x<=l&&y>=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);
		ncalc(&nl,&nr,&nd,ds[l+r-1]);
		return nd;
	}
}

main(n,q,i,t,x,y){
	scanf("%d",&n);
	scanf("%d",ds);
	for(i=1;i<n;i+=2){
		scanf(" %s%d",ds+i,ds+i+1);
	}
	mk(0,1<<16,0,-1);

	scanf("%d",&q);
	for(i=0;i<q;++i){
		t=0;
		scanf(" %s%d%d",&t,&x,&y);
		if(t=='!'){
			t=ds[x-1];
			ds[x-1]=ds[y-1];
			ds[y-1]=t;
			mk(0,1<<16,0,x/2);
			mk(0,1<<16,0,y/2);
		}else{
			N nd=f(0,1<<16,0,x/2,y/2+1);
			printf("%d\n",(0ll+nd.l+nd.r+nd.m)%M);
		}
	}
}