// 長い夜の終わりを信じながら
// Think twice, code once.
#include <cstdio>
#include <string>
#include <cstring>
#include <iostream>
#include <algorithm>
#define eputchar(c) putc(c, stderr)
#define eprintf(...) fprintf(stderr, __VA_ARGS__)
#define eputs(str) fputs(str, stderr), putc('\n', stderr)
using namespace std;

int n, m;
long long w[150005];
string s, t;
int nxt[150005], z[300005], ri[300005];
long long val[150005], sum[150005];
struct SegmentTree {
#define ls(x) ((x) * 2)
#define rs(x) ((x) * 2 + 1)

	int mx[600005], l[600005], r[600005];

	void build(int ll, int rr, int now = 1) {
		l[now] = ll, r[now] = rr;
		if (ll == rr) {mx[now] = ll + z[n + 1 + ll] - 1; return;}
		int mid = (ll + rr) / 2;
		build(ll, mid, ls(now)), build(mid + 1, rr, rs(now));
		mx[now] = max(mx[ls(now)], mx[rs(now)]);
		return;
	}
	int query(int ll, int rr, int val, int now = 1) {
		if (ll <= l[now] && r[now] <= rr) {
			if (mx[now] < val) return 0;
			if (l[now] == r[now]) return l[now];
			if (mx[ls(now)] >= val) return query(ll, rr, val, ls(now));
			else return query(ll, rr, val, rs(now));
		}
		int mid = (l[now] + r[now]) / 2;
		if (rr <= mid) return query(ll, rr, val, ls(now));
		else if (mid < ll) return query(ll, rr, val, rs(now));
		else return query(ll, rr, val, ls(now)) ? : query(ll, rr, val, rs(now));
	}

#undef ls
#undef rs
} tr;

int main() {
	scanf("%d%d", &n, &m);
	cin >> s >> t;
	s = " " + s, t = " " + t;
	for (int i = 1; i <= n; i++) scanf("%lld", &w[i]);
	val[1] = w[1];
	for (int i = 2, j = 0; i <= n; i++) {
		while (j && s[j + 1] != s[i]) j = nxt[j];
		if (s[j + 1] == s[i]) nxt[i] = ++j;
		val[i] = val[j] + w[i];
	}
	for (int i = 1; i <= n; i++) val[i] += val[i - 1], w[i] += w[i - 1];
	string ss = s + t;
	ss[n + 1] = '#';
	for (int i = 2, j = 0; i <= 2 * n + 1; i++) {
		if (i < j + z[j]) z[i] = min(z[i - j + 1], j + z[j] - i);
		while (i + z[i] <= 2 * n + 1 && ss[i + z[i]] == ss[1 + z[i]]) z[i]++;
		if (i + z[i] > j + z[j]) j = i;
		if (i > n + 1) sum[i - n - 1] = sum[i - n - 2] + w[z[i]];
	}
	tr.build(1, n);
	while (m--) {
		int l, r;
		scanf("%d%d", &l, &r);
		int pos = tr.query(l, r, r);
		printf("%lld\n", sum[pos - 1] - sum[l - 1] + val[r - pos + 1]);
	}
	return 0;
}