#include<bits/stdc++.h>
#define ull unsigned long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=500;
const ull base=31;

int n,m; char s[Maxn+5];
ull wl[Maxn+5],wr[Maxn+5];
ull fl[Maxn+5][Maxn+5],fr[Maxn+5][Maxn+5];
ull Pow[Maxn+5],sum[Maxn+5];
int vis[Maxn+5],chk[Maxn+5];

inline ull Hash(int l,int r) {return (sum[r]-sum[l-1])*Pow[n-r];}
inline void Solve(int l,int r)
{
    int len=r-l+1; ull res=Hash(l,r);
    For(i,1,n-len+1) if(Hash(i,i+len-1)==res)
        fl[l][r]+=wl[i],fr[l][r]+=wr[i+len-1];
}
inline ull Count(int l1,int r1,int l2,int r2)
{
    For(i,1,n) vis[i]=chk[i]=0;
    For(i,1,n)
    {
        int flag=1;
        For(j,0,r1-l1)
        {
            if(i+j>n) {flag=0; break;}
            if(s[i+j]!=s[l1+j]) {flag=0; break;}
        }
        vis[i]=flag;
    }
    For(i,1,n)
    {
        int flag=1;
        For(j,0,r2-l2)
        {
            if(i-j<1) {flag=0; break;}
            if(s[i-j]!=s[r2-j]) {flag=0; break;}
        }
        chk[i]=flag;
    }
    int len=max(r1-l1,r2-l2); ull ans=0;
    For(i,1,n) For(j,i+len,n) if(vis[i] && chk[j])
        ans+=fl[i][j]*fr[i][j];
    return ans;
}

int main()
{
 //   freopen("b.in","r",stdin);
  //  freopen("b.out","w",stdout);

    scanf("%d%d",&n,&m);
    scanf("%s",s+1); Pow[0]=1;
    For(i,1,n) scanf("%llu",&wl[i]);
    For(i,1,n) scanf("%llu",&wr[i]);
    For(i,1,n) Pow[i]=Pow[i-1]*base;
    For(i,1,n) sum[i]=sum[i-1]+Pow[i]*s[i];
    For(i,1,n) For(j,i,n) Solve(i,j);
    while(m--)
    {
        int l1,r1,l2,r2;
        scanf("%d%d%d%d",&l1,&r1,&l2,&r2);
        printf("%llu\n",Count(l1,r1,l2,r2));
    }
    return 0;
}