#include <bits/stdc++.h>
using namespace std;
typedef unsigned long long u64;
const int maxn = 150000;
int n, m;
char s[maxn + 5], t[maxn + 5];
int w[maxn + 5];
u64 sw[maxn + 5];
u64 hs[maxn + 5], ht[maxn + 5];
u64 pw[maxn + 5];
int lcp(int a) {
	int p = 0, mx = n - a + 1;
	for (int i = 17; ~i; i--)
		if (int np = p + (1 << i); np <= mx && ht[a + np - 1] - ht[a - 1] == hs[np] * pw[a - 1]) p = np;
	return p;
}
int f[maxn + 5][20];
u64 s1[maxn + 5], s2[maxn + 5], s3[maxn + 5];
int mt[maxn + 5];
int main() {
	scanf("%d%d%s%s", &n, &m, s + 1, t + 1);
	for (int i = 1; i <= n; i++) {
		scanf("%d", &w[i]);
		sw[i] = sw[i - 1] + w[i];
	}
	pw[0] = 1;
	for (int i = 1; i <= n; i++) {
		pw[i] = pw[i - 1] * 127;
		hs[i] = hs[i - 1] + s[i] * pw[i], ht[i] = ht[i - 1] + t[i] * pw[i];
	}
	for (int i = 1; i <= n; i++) s1[i] = s1[i - 1] + sw[lcp(i)];
	s2[1] = s3[1] = w[1];
	for (int i = 2, j = 0; i <= n; i++) {
		while (j && s[i] != s[j + 1]) j = f[j][0];
		if (s[i] == s[j + 1]) j++;
		f[i][0] = j;
		for (int k = 1; k <= 17; k++) f[i][k] = f[f[i][k - 1]][k - 1];
		s2[i] = w[i] + s2[f[i][0]], s3[i] = s3[i - 1] + s2[i];
	}
	for (int i = 1, j = 0; i <= n; i++) {
		while (j && t[i] != s[j + 1]) j = f[j][0];
		if (t[i] == s[j + 1]) j++;
		mt[i] = j;
	}
	for (int i = 1; i <= m; i++) {
		int l, r;
		scanf("%d%d", &l, &r);
		int x = mt[r];
		for (int j = 17; ~j; j--)
			if (f[x][j] && f[x][j] > r - l + 1) x = f[x][j];
		if (x > r - l + 1) x = f[x][0];
		printf("%lld\n", s1[r - x] - s1[l - 1] + s3[x]);
	}
}