#include <bits/stdc++.h>

using namespace std;

#define SZ(x) ((int)((x).size()))
#define lb(x) ((x) & (-(x)))
#define bp(x) __builtin_popcount(x)
#define bpll(x) __builtin_popcountll(x)
#define mkp make_pair
#define pb push_back
#define fi first
#define se second
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef pair<ll, int> pli;
typedef pair<ll, ll> pll;
typedef pair<double, int> pdi;

struct Exkmp {
    int n, m;
    string s, t;    // string (Index from 1)
    vector<int> z, zt;
    /*
    - z  : s 与自己的每个后缀的 lcp 长度
    - zt : s 与 t 的每个后缀的 lcp 长度
    */
    Exkmp(string s): n(SZ(s)), s(" " + s) {    
        z.resize(n + 1, 0);
        zwork();
    }
    Exkmp(string s, string t): n(SZ(s)), m(SZ(t)), s(" " + s), t(" " + t) {
        z.resize(n + 1, 0);
        zt.resize(m + 1, 0);
        zwork();
        ztwork();
    }
    void zwork() {
        z[1] = n;
        int l = 0, r = 0;
        for (int i = 2; i <= n; i++) {
            if (i <= r) {
                z[i] = min(z[i - l + 1], r - i + 1);
            }
            while (i + z[i] <= n && s[z[i] + 1] == s[i + z[i]]) {
                z[i]++;
            }
            if (i + z[i] - 1 > r) {
                l = i; 
                r = i + z[i] - 1;
            }
        }
    }
    void ztwork() { 
        int l = 0, r = 0;
        for (int i = 1; i <= m; i++) {
            if (i <= r) {
                zt[i] = min(z[i - l + 1], r - i + 1);
            }
            while (i + zt[i] <= m && zt[i] + 1 <= n && s[zt[i] + 1] == t[i + zt[i]]) {
                zt[i]++;
            }
            if (i + zt[i] - 1 > r) {
                l = i;
                r = i + zt[i] - 1;
            }
        }
    }
};

void solve() {
    int n, q;
    string s, t;
    cin >> n >> q >> s >> t;
    Exkmp exp(s, t);

    vector w(n + 1, 0);
    vector pre(n + 1, 0ll);
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
        pre[i] = pre[i - 1] + w[i];
    }

    vector val(n + 1, 0ll);
    for (int i = 1; i <= n; i++) {
        val[i] = pre[i];
    }
    ll tot = 0;
    for (int i = 2, r = 2; i <= n; i++) {
        while (r <= n && r + exp.z[r] - 1 < i) {
            tot += pre[exp.z[r]];
            r++;
        }
        val[i] += tot + val[i - r + 1];
    }
    // cout << "gao : " << val[2] << '\n';

    vector qseg(q + 1, pair<pii, int>());
    for (int i = 1; i <= q; i++) {
        int l, r;
        cin >> l >> r;
        qseg[i] = {{l, r}, i};
    }
    sort(qseg.begin() + 1, qseg.begin() + q + 1);

    vector sum(n + 1, 0ll);
    for (int i = 1; i <= n; i++) {
        sum[i] = sum[i - 1] + pre[exp.zt[i]];
    }

    vector ans(q + 1, 0ll);
    priority_queue<pii, vector<pii>, greater<pii>> pq;
    for (int i = 1, j = 1; i <= n; i++) {
        while (j <= q && qseg[j].fi.fi <= i) {
            pq.push({qseg[j].fi.se, j});
            j++;
        }

        while (!pq.empty()) {
            int id = pq.top().se;
            if (qseg[id].fi.se > i + exp.zt[i] - 1) {
                break;
            }
            pq.pop();

            // cout << "i = " << i << '\n';
            // cout << "qujian : " << qseg[id].fi.fi << " " << qseg[id].fi.se << '\n';

            if (qseg[id].fi.se < i) {
                // cout << "nitian" << '\n';
                ans[qseg[id].se] = sum[qseg[id].fi.se] - sum[qseg[id].fi.fi - 1];
            } else {
                // cout << "666" << '\n';
                ans[qseg[id].se] = sum[i - 1] - sum[qseg[id].fi.fi - 1] + val[qseg[id].fi.se - i + 1];
            }
        }
    }
    
    for (int i = 1; i <= q; i++) {
        cout << ans[i] << '\n';
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0), cout.tie(0);
    int T = 1;
    while (T--) solve();
    return 0;
}