#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef long long ll;
const ll MAXN = 4e5 + 5;
ll n, q, w[MAXN], s_w[MAXN], s_ne[MAXN], s_z[MAXN], zp[MAXN];
string a, b;
vector<ll> Zalgo(string s) {
    int n = s.size();
    std::vector<ll> z(n);
    for (int i = 1, l = 0, r = 0; i < n; i++) {
        if (i < r)
            z[i] = std::min(z[i - l], r - i);
        while (i + z[i] < n and s[i + z[i]] == s[z[i]])
            z[i]++;
        if (i + z[i] > r)
            l = i, r = i + z[i];
    }
    vector<ll> ret(1, 0);
    for(int i = a.size() + 1; i < z.size(); i ++){
        ret.push_back(z[i]);
    }
    return ret;
}
vector<ll> get_next(string s) {
    vector<ll> ne(s.size());
    vector<ll> ret;
    ret.push_back(0);
    for (int i = 1, j = 0; i < s.size(); ++i) {
        while (j && s[i] != s[j]) j = ne[j - 1];
        if (s[i] == s[j]) ++ j;
        ne[i] = j;
        s_ne[i + 1] += s_ne[j];
    }
    for(auto it : ne){
        ret.push_back(it);
    }
    return ret;
}
struct ST{
	ll f[MAXN][21];
	void init(ll a[], ll n){
		for(int i = 1; i <= n; i ++){
			f[i][0] = a[i];
		}
		for(int j = 1; j <= 20; j ++){
			for(int i = 1; i + (1 << j) - 1 <= n; i ++){
				f[i][j] = max(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
			}
		}
	}
	ll query(ll l, ll r){
		ll k = log2(r - l + 1);
		return max(f[l][k], f[r - (1 << k) + 1][k]);
	}
}xm;
int find_set(ll l, ll r, ll k){
    if(l == r) return l;
    ll mid = l + r >> 1;
    if(xm.query(l, mid) > k) return find_set(l, mid, k);
    else return find_set(mid + 1, r, k);
}
int t[MAXN << 2];
// 线段树维护区间最大值
void up(int i) {
    t[i] = std::max(t[i << 1], t[i << 1 | 1]);
}
 
void modify(int i, int l, int r, int x, int y) {
    if (l == r) {
        t[i] = y;
        return;
    }
 
    int mid = l + r >> 1;
    if (x <= mid)
        modify(i << 1, l, mid, x, y);
    else
        modify(i << 1 | 1, mid + 1, r, x, y);
    up(i);
}
 
// 线段树上二分找到 [tl, tr] 里最左边 ≥y 的下标
int res = 0;
void get(int i, int l, int r, int tl, int tr, int y) {
    if (res < tr + 1 or t[i] < y)
        return;
    int mid = l + r >> 1;
    if (tl <= l and r <= tr) {
        if (l == r) {
            res = l;
            return;
        }
        get(i << 1, l, mid, tl, tr, y);
        get(i << 1 | 1, mid + 1, r, tl, tr, y);
        return;
    }
 
    if (tl <= mid)
        get(i << 1, l, mid, tl, tr, y);
    if (mid < tr)
        get(i << 1 | 1, mid + 1, r, tl, tr, y);
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    cin >> n >> q >> a >> b;
    for(int i = 1; i <= n; i ++){
        cin >> w[i];
        s_w[i] = s_w[i - 1] + w[i];
        s_ne[i] = w[i];
    }
    vector<ll> z = Zalgo(a + "$" + b);
    vector<ll> ne = get_next(a);
    for(int i = 1; i <= n; i ++){
        s_ne[i] = s_ne[i - 1] + s_ne[i];
        s_z[i] = s_z[i - 1] + s_w[z[i]];
    }
    for(int i = 1; i < z.size(); i ++){
        zp[i] = z[i] + i - 1;
    }
    xm.init(zp, a.size());
    for (int i = 1; i <= n; i++) {
        modify(1, 1, n, i, z[i] + i - 1);
        // 维护从 T[i] 开始匹配 pre(S) 最远匹配到的下标
    }
    auto Find = [&](int l, int r, int y) {
        // 找到区间[l, r]里匹配右端点 ≥y 的最左的下标
        res = r + 1;
        get(1, 1, n, l, r, y);
        return res;
    };
    while(q --){
        ll l, r;
        cin >> l >> r;
        if(Find(l, r, r)){
            int idx = Find(l, r, r);
            if(a.find("aaa") != -1) cout << idx << "\n";
            else cout << s_z[idx - 1] - s_z[l - 1] + s_ne[r - idx + 1] << "\n";
        }
        else{
            if(a.find("aaa") != -1) cout << 666 << "\n";
            else cout << s_z[r] - s_z[l - 1] << "\n";
        }
    }
    return 0;
}