#include<stdio.h>
#include<algorithm>
#include<unordered_map>
using namespace std;
typedef unsigned long long ULL;
const int NR=1e5+5;
const int MR=5e3+5;
const ULL P=401;
char s[NR];
ULL has[NR],mi[NR];
ULL geth(int l,int r)
{
	return has[r]-has[l-1]*mi[r-l+1];
}
ULL a[NR],b[NR];
ULL res[MR][MR];
unordered_map<ULL,ULL> mp1,mp2;
int main()
{
	//freopen("b.in","r",stdin);
	//freopen("b.out","w",stdout);
	int n,m;scanf("%d%d",&n,&m);
	scanf("%s",s+1);
	for(int i=1;i<=n;++i) scanf("%llu",a+i);
	for(int i=1;i<=n;++i) scanf("%llu",b+i);
	mi[0]=1;
	for(int i=1;i<=n;++i) mi[i]=mi[i-1]*P;
	for(int i=1;i<=n;++i) has[i]=has[i-1]*P+s[i];
	for(int i=1;i<=n;++i)
		for(int j=i;j<=n;++j)
		{
			mp1[geth(i,j)]+=a[i];
			mp2[geth(i,j)]+=b[j];
		}
//	printf("%llu %llu\n",geth(1,1),geth(3,3));
	for(int i=1;i<=n;++i)
		for(int j=i;j<=n;++j)
			res[i][j]=mp1[geth(i,j)]*mp2[geth(i,j)];
//	printf("%llu\n",res[1][5]);
	while(m--)
	{
		int l1,r1,l2,r2;scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
		ULL ans=0;
		for(int i=1;i<=n;++i)
		{
			if(i+max(r1-l1,r2-l2)>n||geth(l1,r1)!=geth(i,i+r1-l1)) continue;
			for(int j=i+max(r1-l1,r2-l2);j<=n;++j)
			{
				if(geth(l2,r2)!=geth(j-r2+l2,j)) continue;
				ans+=res[i][j];
			}
		}
		printf("%llu\n",ans);
	}
	return 0;
}