#pragma GCC optimize("Ofast,no-stack-protector,unroll-loops")
// MagicDark
#include <bits/stdc++.h>
#define debug cerr << "[" << __LINE__ << "] "
#define SZ(x) (int) x.size() - 1
#define all(x) x.begin(), x.end()
#define ms(x, y) memset(x, y, sizeof x)
#define F(i, x, y) for (int i = (x); i <= (y); i++)
#define DF(i, x, y) for (int i = (x); i >= (y); i--)
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
template <typename T> inline void chkmax(T& x, T y) {x = max(x, y);}
template <typename T> inline void chkmin(T& x, T y) {x = min(x, y);}
const int N = 3e5 + 10;
int n, m, bor[N], f[N];
ll val[N], ans[N], w[N], bt[N];
char s[N], t[N], a[N];
vector <pair <int, int>> v[N];
vector <int> hh[N];
void kmp() {
	int j = 0;
	val[1] = w[1];
	F(i, 2, n) {
		while (j && s[i] != s[j + 1]) j = bor[j];
		if (s[i] == s[j + 1]) j++;
		val[i] = val[j] + w[i];
		bor[i] = j;
		// debug << i << " " << j << " " << val[i] << endl;
	}
}
void exkmp() {
	int mx = 0, pos;
	F(i, 2, 2 * n) {
		if (i <= mx) f[i] = min(f[i - pos + 1], mx - i + 1);
		while (i + f[i] <= 2 * n && a[f[i] + 1] == a[i + f[i]]) f[i]++;
		if (i + f[i] - 1 > mx) {
			mx = i + f[i] - 1;
			pos = i;
		}
	}
}
void modify(int x, ll y) {
	for (; x; x -= x & -x) bt[x] += y;
}
ll query(int x) {
	ll s = 0;
	for (; x <= n; x += x & -x) s += bt[x];
	return s;
}
signed main() {
	cin.tie(0) -> sync_with_stdio(0);
	cin >> n >> m;
	cin >> (s + 1) >> (t + 1);
	F(i, 1, n) {
		a[i] = s[i];
		a[n + i] = t[i];
	}
	F(i, 1, n) cin >> w[i], w[i] += w[i - 1];
	kmp();
	exkmp();
	F(i, 1, n) f[i] = f[i + n];
	F(i, 1, m) {
		int l, r; cin >> l >> r;
		v[r].emplace_back(l, i);
	}
	set <int> s;
	F(r, 1, n) {
		s.insert(r);
		hh[r + f[r]].push_back(r);
		for (int i: hh[r]) s.erase(i), modify(i, w[f[i]]);
		for (auto [l, id]: v[r]) {
			ans[id] = query(l);
			auto pos = s.lower_bound(l);
			if (pos != s.end()) ans[id] += val[r - *pos + 1];
		}
	}
	F(i, 1, m) cout << ans[i] << '\n';
	return 0;
}
/* why?
*/