#include<bits/stdc++.h>
#define fi first
#define se second
#define mk make_pair
#define pub emplace_back
using namespace std;
#include<bits/extc++.h>
using namespace __gnu_pbds;
const int N=1e5+10;
const int P=131;
typedef unsigned long long ull;
int n,qs;
ull val[N],cf[N];
char s[N];
ull wl[N],wr[N];
int scf;
ull read(){
	ull x=0;char c=getchar();
	while(!isdigit(c)) c=getchar();
	while(isdigit(c)) x=(x<<3)+(x<<1)+(c^48),c=getchar();
	return x;
}
void write(ull x){
	if(x>10) write(x/10);
	putchar(x%10^48);
}
inline ull ask(int l,int r){
	return val[r]-val[l-1]*cf[r-l+1];
}
ull solve(ull v1,int l1,ull v2,int l2){
	vector<int> p1,p2;
	for(int i=1;i+l1-1<=n;i++)
		if(ask(i,i+l1-1)==v1) p1.pub(i);
	for(int i=1;i+l2-1<=n;i++)
		if(ask(i,i+l2-1)==v2) p2.pub(i+l2-1);
	gp_hash_table<ull,pair<pair<ull,ull>,int>> mp;
	int j=0;
	for(int l:p1){
		while(j<p2.size()&&p2[j]-l+1<max(l1,l2)) j++;
		for(int i=j;i<p2.size();i++){
			int r=p2[i];ull v=ask(l,r);
		//	cout<<l<<" "<<r<<endl;
			mp[v].fi.fi+=wl[l];
			mp[v].fi.se+=wr[r];
			mp[v].se++;
		}
	}
	ull ans=0;
	for(auto it:mp) ans+=it.se.fi.fi*it.se.fi.se*it.se.se;
	return ans;
}
int main(){
	scf=scanf("%d %d %s",&n,&qs,s+1);
	for(int i=1;i<=n;i++) val[i]=val[i-1]*P+s[i]-'a'+1;
	cf[0]=1;for(int i=1;i<=n;i++) cf[i]=cf[i-1]*P;
	for(int i=1;i<=n;i++) wl[i]=read();
	for(int i=1;i<=n;i++) wr[i]=read();
	for(int id=1;id<=qs;id++){
		int l1,r1,l2,r2;
		scf=scanf("%d %d %d %d",&l1,&r1,&l2,&r2);
		write(solve(ask(l1,r1),r1-l1+1,ask(l2,r2),r2-l2+1));
		puts("");
	}
	return 0;
}