#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vint;

ull read() {
	ull a = 0, b = 0; char c = getchar();
	while (c < '0' || c > '9') b ^= (c == '-'), c = getchar();
	while (c >= '0' && c <= '9') a = a * 10 - 48 + c, c = getchar();
	return b ? -a : a;
}

const int N = 5002;
const ull B = 31, mod = 4000000007;
typedef unsigned int uint;


char s[N];
ull pw[N];

inline ull st(ull a) { return a >= mod ? a - mod : a; }
struct hsh {
	ull h;
	int l;
	hsh() { h = l = 0; }
	hsh(char c) { l = 1, h = c - 'a' + 1; }
	hsh(ull H, int L) { h = H, l = L; }
	hsh operator + (const hsh &b) const { return hsh { (h * pw[b.l] + b.h) % mod, l + b.l }; }
	hsh operator - (const hsh &b) const { return hsh { st(h - b.h * pw[l - b.l] % mod + mod), l - b.l }; }
	bool operator < (const hsh &b) const { return l == b.l ? h < b.h : l < b.l; }
	bool operator == (const hsh &b) const { return l == b.l && h == b.h; }
} h[N];
int n, q;
ull wl[N], wr[N];
unordered_map<uint, ull> lw[N], rw[N];

mt19937 rnd(20221208 + clock());
ull sum[N][N];

int main() {
//	freopen("b.in", "r", stdin);
//	freopen("b.out", "w", stdout);
	pw[0] = 1; for (int i = 1; i < N; ++i) pw[i] = pw[i - 1] * B % mod;
	n = 300, q = 0;
	n = read(), q = read();
	for (int i = 1; i <= n; ++i) s[i] = bool(rnd() % 20) + 'a';
	scanf("%s", s + 1);
	for (int i = 1; i <= n; ++i) h[i] = h[i - 1] + s[i];
	
	
	for (int i = 1; i <= n; ++i) wl[i] = read();
	for (int i = 1; i <= n; ++i) wr[i] = read();
	for (int i = 1; i <= n; ++i) {
		for (int j = i; j <= n; ++j) {
			hsh H = h[j] - h[i - 1];
			lw[H.l][H.h] += wl[i];
			rw[H.l][H.h] += wr[j];
		}
	}
	for (int i = 1; i <= n; ++i) {
		for (int j = i; j <= n; ++j) {
			hsh H = h[j] - h[i - 1];
			sum[i][j] = lw[H.l][H.h] * rw[H.l][H.h];
		}
	}
	
	while (q--) {
		int l1 = read(), r1 = read(), l2 = read(), r2 = read();
		int L1 = r1 - l1 + 1, L2 = r2 - l2 + 1, mnl = max(L1, L2);
		hsh H1 = h[r1] - h[l1 - 1], H2 = h[r2] - h[l2 - 1];
		ull ans = 0;
		/*
		static ull sr[N];
		memset(sr, 0, sizeof sr);
		for (int i = n; i >= 1; --i) {
			
		}
		*/
		for (int l = 1; l + mnl - 1 <= n; ++l) if (h[l + L1 - 1] - h[l - 1] == H1) {
			for (int r = l + mnl - 1; r <= n; ++r) if (h[r] - h[r - L2] == H2) {
				ans += sum[l][r];
			}
		}
		cout << ans << '\n';
	}
	
	return 0;
}