#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];
string a, b;
vector<ll> z_function(string s) {
    vector<ll> z(s.size());
    z[1] = n;
    for (int i = 2, l = 0, r = 0; i < s.size(); ++i) {
        if (i <= r && z[i - l + 1] < r - i + 1) {
            z[i] = z[i - l + 1];
        }
        else {
            z[i] = max(0ll, r - i + 1);
            while (i + z[i] <= s.size() && s[z[i] + 1] == s[i + z[i]]) ++ z[i];
        }
        if (i + z[i] - 1 > r) l = i, r = i + z[i] - 1;
    }
    vector<ll> ret;
    ret.push_back(0);
    for(int i = a.size() + 2; i < s.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 > 0 && 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{
	vector<vector<ll>> f;
	void init(vector<ll> &a){
        int n = a.size();
        vector<ll> tmp(22, 0);
        f.assign(n, tmp);
		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);
}
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 = z_function(" " + 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]];
    }
    xm.init(z);
    while(q --){
        ll l, r;
        cin >> l >> r;
        if(xm.query(l, r) > r - l + 1){
            int idx = find_set(l, r, r - l + 1);
            cout << s_z[idx - 1] - s_z[l - 1] + s_ne[r - idx + 1] << "\n";
        }
        else{
            cout << s_z[r] - s_z[l - 1] << "\n";
        }
    }
    return 0;
}