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

using ul = unsigned long long;
using ll = long long;
using l3 = __int128_t;
const int N = 5100;
const ul M = 1000000007ll * 1000000009;
#define IO(a) cin.tie(0)->sync_with_stdio(0), cout.tie(0)
#define F(i, a, b) for (int i = (a), iee = (b); i <= iee; i++)

int n, q;
char s[N];
ul wl[N], wr[N], w[N][N];
ul a[N][N];
unordered_map<ul, ul> sl, sr;

int lcp(int x, int y) {
	int l = 0, r = n - max(x, y), ans = -1;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (a[x][x + m] == a[y][y + m])
			ans = m, l = m + 1;
		else
			r = m - 1;
	}
	return ans + 1;
}
int lcs(int x, int y) {
	int l = 0, r = min(x, y) - 1, ans = -1;
	while (l <= r) {
		int m = (l + r) >> 1;
		if (a[x - m][x] == a[y - m][y])
			ans = m, l = m + 1;
		else
			r = m - 1;
	}
	return ans + 1;
}
int cpre(int l1, int r1, int l2, int r2) {
	int l = lcp(l1, l2), x = r1 - l1 + 1, y = r2 - l2 + 1;
	if (l < x && l < y) return s[l1 + l] < s[l2 + l];
	if (l >= x && l >= y) return 0;
	return x < y;
}
int csuf(int l1, int r1, int l2, int r2) {
	int l = lcs(r1, r2), x = r1 - l1 + 1, y = r2 - l2 + 1;
	if (l < x && l < y) return s[r1 - l] < s[r2 - l];
	if (l >= x && l >= y) return 0;
	return x < y;
}
int pre[N], suf[N];

int main() {
	IO(b);
	cin >> n >> q >> s + 1;
	assert(n <= 5000 && q <= 5000);
	F(i, 1, n) cin >> wl[i];
	F(i, 1, n) cin >> wr[i];
	F(i, 1, n) F(j, i, n) a[i][j] = ((l3)a[i][j - 1] * 1145141919810 + s[j]) % M;
	F(i, 1, n) F(j, i, n) sl[a[i][j]] += wl[i], sr[a[i][j]] += wr[i];
	F(i, 1, n) F(j, i, n) w[i][j] = sl[a[i][j]] * sr[a[i][j]];
	F(i, 1, n) pre[i] = suf[i] = i;
	//sort(pre + 1, pre + n + 1, [](int x, int y) { return cpre(x, n, y, n); });
	//sort(suf + 1, suf + n + 1, [](int x, int y) { return csuf(1, x, 1, y); });
	F(i, 1, q) {
		int l1, r1, l2, r2;
		ul ans = 0;
		cin >> l1 >> r1 >> l2 >> r2;
		int s1 = r1 - l1, s2 = r2 - l2, len = max(s1, s2);
		F(i, 1, n) if (a[i][i + s1] == a[l1][r1])
			F(j, i + len, n) if (a[j - s2][j] == a[l2][r2])
				ans += w[i][j];
		cout << ans << "\n";
	}
}