// They say that life is always easier
// After you let yourself come undone
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const int N = 1.5e5 + 10;
int n, m, nxt[N], lcp[N], z[N];
ll w[N];
char s[N], t[N];
void Z() {
	int id = 0, mx = 0;
	while(s[z[2] + 1] == s[z[2] + 2]) ++z[2];
	id = 2, mx = 2 + z[2] - 1;
	for(int i = 3; i <= n; ++i) {
		if(i <= mx) z[i] = min(mx - i + 1, z[i - id + 1]);
		while(s[1 + z[i]] == s[i + z[i]]) ++z[i];
		if(i + z[i] - 1 > mx) id = i, mx = i + z[i] - 1;
	}
	id = 0, mx = 0;
	for(int i = 1; i <= n; ++i) {
		if(i <= mx) lcp[i] = min(mx - i + 1, z[i - id + 1]);
		while(s[1 + lcp[i]] == t[i + lcp[i]]) ++lcp[i];
		if(i + lcp[i] - 1 > mx) id = i, mx = i + lcp[i] - 1;
	}
}
int main() {
	//freopen("data.in", "r", stdin);
	//freopen("code.out", "w", stdout);
	scanf("%d%d", &n, &m);
	scanf("%s%s", &s[1], &t[1]);
	for(int i = 1; i <= n; ++i)
		scanf("%lld", &w[i]), w[i] += w[i - 1];
	Z();
	while(m--) {
		int l, r;
		scanf("%d%d", &l, &r);
		ll ans = 0;
		for(int i = l; i <= r; ++i)
			ans += w[min(r - i + 1, lcp[i])];
		printf("%lld\n", ans);
	}
	return 0;
}