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

typedef unsigned long long ull;
typedef long long ll;

const ull base = 10007;
const int N = 150005;

char s[N], t[N];
int w[N], nxt[N], match[N], st[N][18], lg[N];
ll sw[N], sum[N], sum2[N], res[N];
ull hs[N], ht[N], pw[N];
int n, q;

int query(int l, int r) {
	int k = lg[r - l + 1];
	return max(st[l][k], st[r - (1 << k) + 1][k]);
}

ull ghs(int l, int r) {
	return ht[r] - ht[l - 1] * pw[r - l + 1];
}

int main() {
	scanf("%d%d", &n, &q);
	scanf("%s%s", s + 1, t + 1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &w[i]);
		sw[i] = sw[i - 1] + w[i];
	}
	res[1] = sum[1] = w[1];
	for (int i = 2; i <= n; i++) {
		int k = nxt[i - 1];
		while (k && s[k + 1] != s[i]) k = nxt[k];
		if (s[k + 1] == s[i]) ++k;
		nxt[i] = k;
		sum[i] = w[i] + sum[nxt[i]];
		res[i] = res[i - 1] + sum[i];
	}
	pw[0] = 1;
	for (int i = 1; i <= n; i++) {
		hs[i] = hs[i - 1] * base + s[i];
		ht[i] = ht[i - 1] * base + t[i];
		pw[i] = pw[i - 1] * base;
	}
	for (int i = 1; i <= n; i++) {
		int l = 1, r = n - i + 1, res = 0;
		while (l <= r) {
			int mid = (l + r) >> 1;
			if (ghs(i, i + mid - 1) == hs[mid]) res = mid, l = mid + 1;
			else r = mid - 1;
		}
		match[i] = res;
		// fprintf(stderr, "match[%d] = %d\n", i, match[i]);
	}
	for (int i = 1; i <= n; i++) sum2[i] = sum2[i - 1] + sw[match[i]];
	for (int i = 1; i <= n; i++) st[i][0] = i + match[i] - 1;
	for (int j = 1; j <= 17; j++) {
		for (int i = 1; i <= n - (1 << j) + 1; i++) st[i][j] = max(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
	}
	lg[0] = -1;
	for (int i = 1; i <= n; i++) lg[i] = lg[i >> 1] + 1;
	while (q--) {
		int l, r;
		scanf("%d%d", &l, &r);
		if (query(l, r) <= r) printf("%lld\n", sum2[r] - sum2[l - 1]);
		else {
			int L = l, R = r, pos = r;
			while (L <= R) {
				int mid = (L + R) >> 1;
				if (query(l, mid) > r) pos = mid, R = mid - 1;
				else L = mid + 1;
			}
			ll ans = sum2[pos - 1] - sum2[l - 1] + res[r - pos + 1];
			printf("%lld\n", ans);
		}
	}
	return 0;
}