#include <bits/stdc++.h>
using namespace std;
const int N = 2e5 + 5;
typedef long long ll;
typedef pair<int,int> pii;
#define FI first
#define SE second
#define mkp make_pair
int n,Q;
char s[N],t[N];
int nxt[N],Z[N],L[N];
ll w[N],sum[N];
int ql[N],qr[N];
ll ans[N];
set<int> Is;
vector<int> del[N]; // i + L[i]
vector<int> Qs[N];
struct BIT {
	ll tr[N];
	#define lowbit(x) (x&(-x))
	inline void upd(int x,ll v) { for(int i = x;i <= n;i += lowbit(i)) tr[i] += v;}
	inline ll Sum(int x) { ll res = 0;for(int i = x;i;i ^= lowbit(i)) res += tr[i];return res;}
} C;
int main() {
	scanf("%d%d",&n,&Q);
	scanf("%s%s",s + 1,t + 1);
	for(int i = 1;i <= n;i++) scanf("%lld",&w[i]),w[i] += w[i - 1];
	for(int i = 1;i <= Q;i++) scanf("%d%d",&ql[i],&qr[i]),Qs[qr[i]].push_back(i);
	Z[1] = n;
	for(int i = 2,l = 0,r = 0;i <= n;i++) {
		if(i <= r) Z[i] = min(Z[i - l + 1],r - i + 1);
		while(s[1 + Z[i]] == s[i + Z[i]]) ++Z[i];
		if(i + Z[i] - 1 > r) l = i,r = i + Z[i] - 1;
	}
	for(int i = 1,l = 0,r = 0;i <= n;i++) {
		if(i <= r) L[i] = min(Z[i - l + 1],r - i + 1);
		while(s[1 + L[i]] == t[i + L[i]]) ++L[i];
		if(i + L[i] - 1 > r) l = i,r = i + L[i] - 1;
	}
	for(int i = 1;i <= n;i++) del[i + L[i]].push_back(i);
	nxt[1] = 0;
	for(int i = 2,j = 0;i <= n;i++) {
		while(j && s[i] != s[j + 1]) j = nxt[j];
		if(s[i] == s[j + 1]) ++j;
		nxt[i] = j;
	}
	for(int i = 1;i <= n;i++) sum[i] = sum[nxt[i]] + w[i];
	for(int r = 1;r <= n;r++) {
		Is.insert(r);
		for(auto i : del[r]) Is.erase(i),C.upd(i,w[L[i]]);
		for(auto i : Qs[r]) {
			auto it = Is.lower_bound(ql[i]);
			if(it != Is.end())
				ans[i] += sum[r - (*it) + 1];
			ans[i] += C.Sum(r) - C.Sum(ql[i] - 1);
		}
	}
	for(int i = 1;i <= Q;i++) cout << ans[i] << endl;
	return 0;
}