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

typedef long long ll;
typedef pair<int, int> pii;
const int maxn = 1.5e5 + 5;

char s[maxn], t[maxn];
int w[maxn];
ll pre[maxn], sum[maxn], ans[maxn];

struct BIT
{
	ll c[maxn];
	void add(int x, ll d)
	{
		for (; x < maxn; x += (x & -x)) c[x] += d;
	}
	ll sum(int x)
	{
		if (!x) return 0;
		ll ans = 0; for (; x; x -= (x & -x)) ans += c[x];
		return ans;
	}
}bit;

vector<pii> qd[maxn];
vector<int> qv[maxn];
int z[maxn], p[maxn], nxt[maxn];
set<int> st;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0); 
	
	int n, m;
	cin >> n >> m >> s >> t;
	for (int i = 1; i <= n; i++) cin >> w[i], pre[i] = pre[i - 1] + w[i];
	for (int i = 1; i <= m; i++)
	{
		int l, r;
		cin >> l >> r;
		qd[r].emplace_back(make_pair(l, i));
	}
	
	int r = 0, pos = 1;
	z[0] = n;
	while (r + 1 < n && s[r] == s[r + 1]) r++;
	z[1] = r;
	for (int i = 2; i < n; i++)
	{
		r = pos + z[pos] - 1;
		int l = z[i - pos];
		if (i + l <= r) z[i] = l;
		else
		{
			int j = max(0, r - i + 1);
			while (j + i < n && s[j] == s[j + i]) j++;
			z[i] = j;
			pos = i;
		}
	}
	
	r = 0, pos = 0;
	while (r < n && s[r] == t[r]) r++;
	p[0] = r;
	for (int i = 1; i < n; i++)
	{
		r = pos + p[pos] - 1;
		int l = z[i - pos];
		if (i + l <= r) p[i] = l;
		else
		{
			int j = max(0, r - i + 1);
			while (j + i < n && t[j + i] == s[j]) j++;
			p[i] = j;
			pos = i;
		}
	}
	for (int i = n - 1; ~i; i--) p[i + 1] = p[i], s[i + 1] = s[i];
	for (int i = 1; i <= n; i++) if (p[i]) qv[i + p[i]].push_back(i);
	
	pos = 0;
	nxt[0] = nxt[1] = 0;
	for (int i = 2; i <= n; i++)
	{
		while (pos && s[pos + 1] != s[i]) pos = nxt[pos];
		if (s[pos + 1] == s[i]) pos++;
		nxt[i] = pos;
	}
	for (int i = 1; i <= n; i++) sum[i] = sum[nxt[i]] + pre[i];
	
	for (int i = n; i; i--)
	{
		for (int x : qv[i + 1]) st.insert(x);
		for (pii tmp : qd[i])
		{
			if (!st.size()) continue;
			int x = *st.lower_bound(tmp.first);
			if (x <= i) ans[tmp.second] = sum[i - x + 1]; 
		}
	}
	
	for (int i = 1; i <= n; i++)
	{
		for (int x : qv[i]) bit.add(1, pre[i - x]), bit.add(x + 1, -pre[i - x]);
		for (pii tmp : qd[i]) ans[tmp.second] += bit.sum(tmp.first);
	}
	
	for (int i = 1; i <= m; i++) cout << ans[i] << "\n"; 
	return 0;
}