#include<bits/stdc++.h>
#define ull unsigned long long
using namespace std;
const int N=1e5+10;
int n,m;
char ch;
template<typename T>
inline void read(T &x){
	x=0;ch=getchar();while(ch<33)ch=getchar();
	while(ch>47)x=(x<<1)+(x<<3)+(ch^48),ch=getchar();
}
void write(ull x){if(x>9)write(x/10);putchar(48|x%10);}
char s[N];
int id1[N<<1],id2[N<<1],tmp_id[N<<1],tmp_v[N<<1];
ull a[N],b[N];
inline void sort(int n,int *id,int V,int *v,bool b=0){
	static int cnt[N],i;
	memset(cnt,0,(V+1)<<2);
	for(i=1;i<=n;++i)++cnt[v[i]];
	if(b){for(i=V-1;~i;--i)cnt[i]+=cnt[i+1];}
	else {for(i=1;i<=V;++i)cnt[i]+=cnt[i-1];}
	for(i=1;i<=n;++i)id[cnt[v[i]]--]=i;
}
int rpos1[N],lpos2[N];
int ff1[N<<1][17],ff2[N<<1][17];
int mxlen1[N<<1],link1[N<<1];
int trans1[N<<1][26];
int h1[N<<1],to1[N<<1],nextn1[N<<1],edg1;
int mxlen2[N<<1],link2[N<<1];
int trans2[N<<1][26];
int h2[N<<1],to2[N<<1],nextn2[N<<1],edg2;
int tot1=1,tot2=1,last,tmp,x,y,xx,tt;
int posl1[N<<1],posr1[N<<1];
int posl2[N<<1],posr2[N<<1];
int occ1[N<<1],occ2[N<<1];
int dfn1[N<<1],dfnr1[N<<1],rev1[N<<1];
int dfn2[N<<1],dfnr2[N<<1],rev2[N<<1];
ull vl[N<<1],vr[N<<1];
inline void add1(int x,int y){
	to1[++edg1]=y,nextn1[edg1]=h1[x],h1[x]=edg1;
}
inline void add2(int x,int y){
	to2[++edg2]=y,nextn2[edg2]=h2[x],h2[x]=edg2;
}
void extend1(char a){
	y=last,tmp=++tot1;
	mxlen1[tmp]=mxlen1[y]+1; 
	for(;!trans1[y][a]&&y;y=link1[y])trans1[y][a]=tmp;
	if(!y)link1[tmp]=1;
	else {
		x=trans1[y][a];
		if(mxlen1[x]==mxlen1[y]+1)link1[tmp]=x;
		else {
			xx=++tot1;mxlen1[xx]=mxlen1[y]+1;
			memcpy(trans1[xx],trans1[x],104);
			link1[xx]=link1[x];posr1[xx]=posr1[x];
			for(;trans1[y][a]==x;y=link1[y])trans1[y][a]=xx;
			link1[x]=link1[tmp]=xx;
		}
	}
	last=tmp;
}
void extend2(char a){
	y=last,tmp=++tot2;
	mxlen2[tmp]=mxlen2[y]+1; 
	for(;!trans2[y][a]&&y;y=link2[y])trans2[y][a]=tmp;
	if(!y)link2[tmp]=1;
	else {
		x=trans2[y][a];
		if(mxlen2[x]==mxlen2[y]+1)link2[tmp]=x;
		else {
			xx=++tot2;mxlen2[xx]=mxlen2[y]+1;
			memcpy(trans2[xx],trans2[x],104);
			link2[xx]=link2[x];posl2[xx]=posl2[x];
			for(;trans2[y][a]==x;y=link2[y])trans2[y][a]=xx;
			link2[x]=link2[tmp]=xx;
		}
	}
	last=tmp;
}
void dfs1(int x){
	int i,y;rev1[dfn1[x]=++tt]=x;ff1[x][0]=link1[x];
	for(i=1;i!=17;++i)ff1[x][i]=ff1[ff1[x][i-1]][i-1];
	for(i=h1[x];y=to1[i];i=nextn1[i]){
		dfs1(y),vr[x]+=vr[y],occ1[x]+=occ1[y];
	}
	dfnr1[x]=tt;
}
void build1(){
	int i;last=1;
	for(i=1;i<=n;++i){
		extend1(s[i]),posr1[tmp]=i;
		vr[tmp]=b[i];rpos1[i]=tmp,occ1[tmp]=1;
	}
	for(i=2;i<=tot1;++i)posl1[i]=posr1[i]-mxlen1[i]+1;
	for(i=2;i<=tot1;++i)add1(link1[i],i);
	dfs1(1);
}
void dfs2(int x){
	int i,y;rev2[dfn2[x]=++tt]=x;ff2[x][0]=link2[x];
	for(i=1;i!=17;++i)ff2[x][i]=ff2[ff2[x][i-1]][i-1];
	for(i=h2[x];y=to2[i];i=nextn2[i]){
		dfs2(y),vl[x]+=vl[y],occ2[x]+=occ2[y]; 
		if(posl2[y]<posl2[x])posl2[x]=posl2[y];
	}
	dfnr2[x]=tt;
}
void build2(){
	int i;last=1;tt=0;
	for(i=n;i;--i){
		extend2(s[i]),posl2[tmp]=i;
		vl[tmp]=a[i];lpos2[i]=tmp,occ2[tmp]=1;
	}
	for(i=2;i<=tot2;++i)add2(link2[i],i);
	dfs2(1); 
	for(i=2;i<=tot2;++i)posr2[i]=posl2[i]+mxlen2[i]-1;
}
inline int get1(int l,int r){
	static int x,i;
	x=rpos1[r];l=r-l+1;
	for(i=16;~i;--i)if(mxlen1[ff1[x][i]]>=l)x=ff1[x][i];
	return x; 
}
inline int get2(int l,int r){
	static int x,i;
	x=lpos2[l];r=r-l+1;
	for(i=16;~i;--i)if(mxlen2[ff2[x][i]]>=r)x=ff2[x][i]; 
	return x;
}
int cn=1;
int ext1[N<<1],ext2[N<<1];
int sn1[N<<1],sn2[N<<1];
int p1[N<<1],p2[N<<1];
int *rp1[N<<1],rp1_[N<<1],*_rp1=rp1_;
int *rp2[N<<1],rp2_[N<<1],*_rp2=rp2_;
void build(){
	int i,j,k,l1,r2;
	sort(tot1,tmp_id,n,posr1,1);
	for(i=1;i<=tot1;++i)tmp_v[i]=posl1[tmp_id[i]];
	sort(tot1,id1,n,tmp_v);
	for(i=1;i<=tot1;++i)id1[i]=tmp_id[id1[i]];
	
	sort(tot2,tmp_id,n,posr2,1);
	for(i=1;i<=tot2;++i)tmp_v[i]=posl2[tmp_id[i]];
	sort(tot2,id2,n,tmp_v);
	for(i=1;i<=tot2;++i)id2[i]=tmp_id[id2[i]];
	k=2;
	for(i=2;i<=tot1;i=j){
		j=i;l1=posl1[id1[i]];
		while(posl2[id2[k]]<l1&&k<=tot2)++k;
		while(posl1[id1[j]]==l1){
			ext1[id1[j]]=cn;
			p1[id1[j]]=sn1[cn]++;
			if(posr1[id1[j]]==posr2[id2[k]])++cn,++k;
			++j;
		}
	}
	--cn;
	memcpy(tmp_id+1,id1+1,tot1<<2);
	for(i=1;i<=tot1;++i)tmp_v[i]=posr1[id1[i]];
	sort(tot1,id1,n,tmp_v);
	for(i=1;i<=tot1;++i)id1[i]=tmp_id[id1[i]];

	memcpy(tmp_id+1,id2+1,tot2<<2);
	for(i=1;i<=tot2;++i)tmp_v[i]=posr2[id2[i]];
	sort(tot2,id2,n,tmp_v);
	for(i=1;i<=tot2;++i)id2[i]=tmp_id[id2[i]];
	k=2;
	for(i=2;i<=tot2;i=j){
		j=i;r2=posr2[id2[i]];
		while(posr1[id1[k]]<r2&&k<=tot1)++k;
		while(posr2[id2[j]]==r2){
			ext2[id2[j]]=ext1[id1[k]];
			p2[id2[j]]=sn2[ext1[id1[k]]]++;
			if(posl1[id1[k]]==posl2[id2[j]])++k;
			++j;
		}
	}
	for(i=1;i<=cn;++i)rp1[i]=_rp1,_rp1+=sn1[i];
	for(i=1;i<=cn;++i)rp2[i]=_rp2,_rp2+=sn2[i];
	for(i=2;i<=tot1;++i)p1[i]=sn1[ext1[i]]-p1[i]-1;
	for(i=2;i<=tot2;++i)p2[i]=sn2[ext2[i]]-p2[i]-1;
	for(i=2;i<=tot1;++i)x=id1[i],rp1[ext1[x]][p1[x]]=x;
	for(i=2;i<=tot2;++i)x=id2[i],rp2[ext2[x]][p2[x]]=x;
}
ull ans[N];
ull s_[N<<1],ss_[N<<1],*_s=s_,*_ss=ss_;
int id_[N<<1],bl_[N<<1],*_id=id_,*_bl=bl_; 
struct Block{
	ull *s,*ss;int *id,*bl;int n,nn,il;
	inline void init(int n_){
		n=n_;s=_s,ss=_ss,id=_id,bl=_bl;
		_s+=n,_ss+=n,_id+=n,_bl+=n;
		nn=sqrt(n);int i;
		for(i=0,n_=0;i<n;i+=nn,++n_)id[i]=n_,bl[i]=i;
		for(i=1;i<n;++i)id[i]||(id[i]=id[i-1],bl[i]=bl[i-1]);
	}
	inline void upd(int i,ull v){
		il=bl[i];for(;i>=il;--i)s[i]+=v;
		if(~i)for(i=id[i];~i;--i)ss[i]+=v;
	}
	inline ull inq(int i){return s[i]+ss[id[i]];}
}B[N<<1];
ull res;
struct Step2{
	int id[N<<1],m,nn;
	struct inq{
		int x,y,i,idx;bool o;inq()=default;
		inq(int _x,int _y,int _i,bool _o):
			x(_x),y(_y),i(_i),o(_o){}
		inline bool operator <(const inq &a)const {
			return idx!=a.idx?idx<a.idx:idx&1?y<a.y:y>a.y;
		}
	}q[N<<2];
	inline void add(int x,int y,int i){
		q[++m]=inq(dfnr1[x],dfnr2[y],i,1);
		q[++m]=inq(dfn1[x],dfnr2[y],i,0);
		q[++m]=inq(dfnr1[x],dfn2[y],i,0);
		q[++m]=inq(dfn1[x],dfn2[y],i,1); 
	}
	int X,Y,x,y;
	struct Edge{
		int h[N<<1],l[N<<2],r[N<<2],nextn[N<<2],edg;
		ull dt[N<<2];
		inline void add(int x,int _l,int _r){
			++edg;l[edg]=_l,r[edg]=_r;
			nextn[edg]=h[x],h[x]=edg;
		}
		inline void inq(bool b){
			++edg;
			b?res+=dt[edg]:res-=dt[edg];
		}
	}Ex,Ey;
	#define ForE(E) for(j=E.h[i];j;j=E.nextn[j])
	void solve(){
		if(!m)return;
		int i,j,l,r;
		nn=tot1/sqrt(m);nn||(nn=1);
		for(i=tot1;i;--i)id[i]=(i-1)/nn+1;
		for(i=1;i<=m;++i)q[i].idx=id[q[i].x];
		sort(q+1,q+m+1);
		X=1,Y=1;
		for(i=1;i<=m;++i){
			x=q[i].x,y=q[i].y;
			if(Y<y)Ex.add(X,Y,y),Y=y;
			if(y<Y)Ex.add(X,y,Y),Y=y;
			if(X<x)Ey.add(Y,X,x),X=x;
			if(x<X)Ey.add(Y,x,X),X=x;
		}
		for(i=1;i<=cn;++i)B[i].init(sn2[i]);
		ull v;
		for(i=2;i<=tot1;++i){
			x=rev1[i];
			B[ext1[x]].upd(mxlen1[x]-mxlen1[link1[x]]-1,vr[x]*occ1[x]);
			ForE(Ex){
				l=Ex.l[j];v=0;
				for(r=Ex.r[j];r>l;--r){
					y=rev2[r];
					v+=B[ext2[y]].inq(p2[y])*vl[y];
				}
				Ex.dt[j]=v;
			}
		}
		memset(s_,0,tot2<<3);
		memset(ss_,0,tot2<<3);
		memset(id_,0,tot2<<3);
		_s=s_,_ss=ss_,_id=id_,_bl=bl_; 
		for(i=1;i<=cn;++i)B[i].init(sn1[i]);
		for(i=2;i<=tot2;++i){
			y=rev2[i];
			B[ext2[y]].upd(mxlen2[y]-mxlen2[link2[y]]-1,vl[y]*occ2[y]);
			ForE(Ey){
				l=Ey.l[j];v=0;
				for(r=Ey.r[j];r>l;--r){
					x=rev1[r];
					v+=B[ext1[x]].inq(p1[x])*vr[x];
				}
				Ey.dt[j]=v;
			}
		}
		X=1,Y=1;
		Ex.edg=Ey.edg=0;
		for(i=1;i<=m;++i){
			x=q[i].x,y=q[i].y;
			if(Y<y)Ex.inq(1),Y=y;
			if(y<Y)Ex.inq(0),Y=y;
			if(X<x)Ey.inq(1),X=x;
			if(x<X)Ey.inq(0),X=x;
			ans[q[i].i]+=q[i].o?res:-res;
		}
	} 
}Z;
struct Step1{
	struct bit{
		ull t[N<<1],res;int n;
		inline void clr(){memset(t+1,0,n<<3);}
		inline void clr(int i){for(;i<=n;i+=i&(-i))t[i]=0;}
		inline void upd(int i,ull v){for(;i<=n;i+=i&(-i))t[i]+=v;}
		inline ull inq(int i){for(res=0;i;i-=i&(-i))res+=t[i];return res;}
	}T;
	struct inq{
		int ext,r,vl,vr,i;ull mul;inq()=default;
		inq(int _ext,int _r,int _vl,int _vr,ull _mul,int _i):
			ext(_ext),r(_r),vl(_vl),vr(_vr),mul(_mul),i(_i){}
		inline bool operator <(const inq &a)const {
			return ext!=a.ext?ext<a.ext:r<a.r;
		}
	}q1[N],q2[N];
	int qtot1,qtot2,x,y;
	inline void add1(int x,int _r,int y,ull mul,int i){
		q1[++qtot1]=inq(ext1[x],_r,dfn2[y],dfnr2[y],mul,i);
	}
	inline void add2(int y,int _r,int x,ull mul,int i){
		q2[++qtot2]=inq(ext2[y],_r,dfn1[x],dfnr1[x],mul,i);
	}
	void solve1(inq *q){
		T.n=tot2;
		sort(q+1,q+qtot1+1);
		int i,j=0,l,extp=-1;
		for(i=1;i<=qtot1;++i){
			if(q[i].ext!=extp){
				for(l=0;l<j;++l)T.clr(dfn2[rp2[extp][l]]);
				extp=q[i].ext,j=0;
			}
			while(j<=q[i].r){
				x=rp2[extp][j++],T.upd(dfn2[x],vl[x]);
			}
			ans[q[i].i]+=(T.inq(q[i].vr)-T.inq(q[i].vl))*q[i].mul;
		}
	}
	void solve2(inq *q){
		T.clr();T.n=tot1;
		sort(q+1,q+qtot2+1);
		int i,j=0,l,extp=-1;
		for(i=1;i<=qtot2;++i){
			if(q[i].ext!=extp){
				for(l=0;l<j;++l)T.clr(dfn1[rp1[extp][l]]);
				extp=q[i].ext,j=0;
			}
			while(j<=q[i].r){
				x=rp1[extp][j++],T.upd(dfn1[x],vr[x]);
			}
			ans[q[i].i]+=(T.inq(q[i].vr)-T.inq(q[i].vl))*q[i].mul;
		}
	}
	void solve(){solve1(q1);solve2(q2);} 
}S;
int main(){
	int i,l1,r1,l2,r2,u,v;
	read(m),read(m);
	while(ch<33)ch=getchar();
	while(ch>96)s[++n]=ch-97,ch=getchar();
	for(i=1;i<=n;++i)read(a[i]);
	for(i=1;i<=n;++i)read(b[i]);
	build1();
	build2();
	build();
	for(i=1;i<=m;++i){
		read(l1),read(r1);y=get2(l1,r1);
		read(l2),read(r2);x=get1(l2,r2);
		u=posr1[x]-posl1[x]-r2+l2;
		v=posr2[y]-posl2[y]-r1+l1;
		if(ext1[x]==ext2[y]&&p2[y]<=u&&p1[x]<=v)ans[i]=vr[x]*vl[y]*occ1[x];
		if(h2[y])S.add1(x,u,y,vr[x]*occ1[x],i);
		if(h1[x])S.add2(y,v,x,vl[y]*occ2[y],i);
		if(h1[x]&&h2[y])Z.add(x,y,i);
	}
	S.solve();
	Z.solve();
	for(i=1;i<=m;++i)write(ans[i]),putchar('\n');
}