#include<bits/stdc++.h>
#define Gc() getchar()
#define Me(x,y) memset(x,y,sizeof(x))
#define Mc(x,y) memcpy(x,y,sizeof(x))
#define d(x,y) ((m)*(x-1)+(y))
#define R(n) (rnd()%(n)+1)
#define Pc(x) putchar(x)
#define LB lower_bound
#define UB upper_bound
#define fi first
#define se second
#define eb emplace_back
#define all(x) x.begin(),x.end()
using namespace std;using ll=long long;using db=double;using lb=long db;using ui=unsigned;using ull=unsigned long long;using pii=pair<int,int>;
const int N=4e5+5,M=1e7+5,K=1000+5,mod=998244353,Mod=mod-1;const db eps=1e-9;const int INF=1e9+7;mt19937 rnd(263082);
#define Tp template<typename T>
#define Ts template<typename T,typename... Ar>
namespace Debug{
	Tp void _debug(char* f,T t){cerr<<f<<'='<<t<<endl;}
	Ts void _debug(char* f,T x,Ar... y){while(*f!=',') cerr<<*f++;cerr<<'='<<x<<",";_debug(f+1,y...);}
	#ifdef LOCAL
	#define gdb(...) _debug((char*)#__VA_ARGS__,__VA_ARGS__)
	#else 
	#define gdb(...) void()
	#endif
}using namespace Debug;
int n,q;
char s[N];
ull wl[N],wr[N];
struct SAM{
	int son[N][26],link[N],len[N],ed[N],La=1,cnt=1;
	void extend(int c){
		len[++cnt]=len[La]+1;int p=La;La=cnt;siz[La]=1;
		while(p&&!son[p][c]) son[p][c]=La,p=link[p];
		if(!p){link[La]=1;return;}
		int q=son[p][c];if(len[q]==len[p]+1){link[La]=q;return;}
		len[++cnt]=len[p]+1;Mc(son[cnt],son[q]);link[cnt]=link[q];link[q]=link[La]=cnt;ed[cnt]=ed[q];
		while(p&&son[p][c]==q) son[p][c]=cnt,p=link[p];
	}
	vector<int> S[N];
	int bl[N];
	int bg[N],en[N],bh,df[N];
	int trans[N][26];
	ull sum[N],siz[N];
	void make(int x,int La){
		bg[x]=++bh;df[bh]=x;
		for(int i:S[x]) make(i,x),ed[i]+len[x]<=n&&(trans[x][s[ed[i]+len[x]]-'a']=i),ed[x]=ed[i],sum[x]+=sum[i],siz[x]+=siz[i];
		en[x]=bh;
	}
	int fa[20][N];
	void build(){
		for(int i=2;i<=cnt;i++) S[link[i]].push_back(i);
		make(1,0);
		for(int i=1;i<=cnt;i++) fa[0][i]=link[i];
		for(int i=1;i<=18;i++) for(int j=1;j<=cnt;j++) fa[i][j]=fa[i-1][fa[i-1][j]];
	}
	vector<int> G[N];
	void push(int x){
		for(int i=0;i<26;i++) if(son[x][i]&&len[son[x][i]]==len[x]+1){
			push(son[x][i]);
			if(!bl[x]) bl[x]=bl[son[x][i]];
		}
		// gdb(x,bl[x]);
		G[bl[x]].push_back(x);
	}
	int jump(int x,int k){
		for(int i=18;~i;i--) if(len[fa[i][x]]>=k) x=fa[i][x];
		return x;
	}
}t1,t2;
int cnt,mx[N];
void dfs(int x,int y){
	// gdb(x,y,t1.len[x],t2.len[y]);
	if(t1.len[x]==t2.len[y]) t1.bl[x]=t2.bl[y]=++cnt,mx[cnt]=t1.len[x];
	for(int i=0;i<26;i++) if(t1.son[x][i]&&t1.len[x]+1==t1.len[t1.son[x][i]]) dfs(t1.son[x][i],t1.len[x]==t2.len[y]?t2.trans[y][i]:y);
}
int i1[N],i2[N];
void build(){
	for(int i=1;i<=n;i++) t1.extend(s[i]-'a'),i1[i]=t1.La,t1.sum[t1.La]=wr[i],t1.ed[t1.La]=i;
	for(int i=n;i;i--) t2.extend(s[i]-'a'),i2[i]=t2.La,t2.sum[t2.La]=wl[i],t2.ed[t2.La]=i;
	t1.build();t2.build();
	dfs(1,1);
	t1.push(1);t2.push(1);
	for(int i=1;i<=t1.cnt;i++) t1.sum[i]*=t1.siz[i];
}
ull ans[N];
struct ques{int l,r,id;ull w;}Q[N];int Qh;
ull qans[N];
vector<ques> S1[N],S2[N];
ull buf[N*2],*head;
struct DS{
	ull *f,*g;
	int m,Bl;
	void resize(int n){
		f=head;head+=n+1;
		m=n;Bl=sqrt(m);
		g=head;head+=m/Bl+1;
		fill(f,f+n+1,0);
	}
	void add(int x,ll w){
		for(int i=x;i<=m&&i/Bl==x/Bl;i++) f[i]+=w;
		for(int i=x/Bl;i<=m/Bl;i++) g[i]+=w;
	}
	ll qry(int x){return f[x]+(x/Bl?g[x/Bl-1]:0);}
}f[N];
void work(){
	head=buf;
	for(int i=1;i<=cnt;i++) f[i].resize(t1.G[i].size()+t2.G[i].size());
	for(int i=1;i<=t2.cnt;i++){
		f[t2.bl[t2.df[i]]].add(mx[t2.bl[t2.df[i]]]-t2.len[t2.df[i]],t2.sum[t2.df[i]]);
		for(auto j:S1[i]){
			for(int h=j.l;h<=j.r;h++) qans[j.id]+=j.w*t1.sum[t1.df[h]]*f[t1.bl[t1.df[h]]].qry(t1.len[t1.df[h]]-t1.len[t1.link[t1.df[h]]]-1);
		}
	}
}
void Solve(){
	int i,j;scanf("%d%d%s",&n,&q,s+1);
	for(i=1;i<=n;i++) scanf("%llu",&wl[i]);
	for(i=1;i<=n;i++) scanf("%llu",&wr[i]);
	build();
	for(i=1;i<=q;i++){
		int l1,r1,l2,r2;
		scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
		int x=t2.jump(i2[l1],r1-l1+1),y=t1.jump(i1[r2],r2-l2+1);
		int i1=t2.bl[x],i2=t1.bl[y],len1=r1-l1+1,len2=r2-l2+1;
		if(t1.bl[y]==t2.bl[x]){
			if(t2.len[x]+t1.len[y]-mx[i1]>t1.len[t1.link[y]]&&t2.len[x]+t1.len[y]-mx[i1]<max(len1,len2)) ans[i]-=t1.sum[y]*t2.sum[x];
		}else{
			for(int j=t2.len[x]-len1+1;j<=t2.len[x]-(t2.len[t2.link[x]]+1);j++){
				if(t1.bg[y]<=t1.bg[t1.G[i1][j]]&&t1.bg[t1.G[i1][j]]<=t1.en[y]) ans[i]-=t2.sum[x]*t1.sum[t1.G[i1][j]];
			}
			for(int j=t1.len[y]-len2+1;j<=t1.len[y]-(t1.len[t1.link[y]]+1);j++){
				if(t2.bg[x]<=t2.bg[t2.G[i2][j]]&&t2.bg[t2.G[i2][j]]<=t2.en[x]) ans[i]-=t1.sum[y]*t2.sum[t2.G[i2][j]];
			}
		}
		Q[++Qh]=(ques){t1.bg[y]-1,t2.bg[x]-1,i,1};
		Q[++Qh]=(ques){t1.en[y],t2.en[x],i,1};
		Q[++Qh]=(ques){t1.bg[y]-1,t2.en[x],i,-1ull};
		Q[++Qh]=(ques){t1.en[y],t2.bg[x]-1,i,-1ull};
	}

	int l=0,r=0,Bl=max(n/sqrt(q),1.0);

	sort(Q+1,Q+Qh+1,[&](ques x,ques y){return x.l/Bl^y.l/Bl?x.l<y.l:(x.l/Bl&1?x.r<y.r:x.r>y.r);});
	
	for(i=1;i<=Qh;i++){
		qans[i]=qans[i-1];
		if(l<Q[i].l)S1[r].push_back((ques){l+1,Q[i].l,i,1});
		else S1[r].push_back((ques){Q[i].l+1,l,i,-1ull});
		l=Q[i].l;
		if(r<Q[i].r) S2[l].push_back((ques){r+1,Q[i].r,i,1});
		else S2[l].push_back((ques){Q[i].r+1,r,i,-1ull});
		r=Q[i].r;
	}
	work();
	swap(t1,t2);swap(S1,S2);
	work();
	for(i=1;i<=Qh;i++) qans[i]+=qans[i-1],ans[Q[i].id]+=qans[i]*Q[i].w;
	for(i=1;i<=q;i++) printf("%llu\n",ans[i]);
}
int main(){
	int t=1;
	// scanf("%d",&t);
	while(t--) Solve();
	cerr<<clock()*1.0/CLOCKS_PER_SEC<<'\n';
}