#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
#define TIME (clock() * 1.0 / CLOCKS_PER_SEC)

vector<int> z_function (string s) {
    int n = (int) s.length();
    vector<int> z (n);
    for (int i=1, l=0, r=0; i<n; ++i) {
        if (i <= r)
            z[i] = min (r-i+1, z[i-l]);
        while (i+z[i] < n && s[z[i]] == s[i+z[i]])
            ++z[i];
        if (i+z[i]-1 > r)
            l = i,  r = i+z[i]-1;
    }
    z[0] = 0;
    return z;
}

vector<int> prefix_function (string s) {
    int n = (int) s.length();
    vector<int> pi (n);
    for (int i=1; i<n; ++i) {
        int j = pi[i-1];
        while (j > 0 && s[i] != s[j])
            j = pi[j-1];
        if (s[i] == s[j])  ++j;
        pi[i] = j;
    }
    return pi;
}

const int M = 2e5 + 239;
const int L = 18;

int n, m;
string s, t;
ll w[M], pref[M];
int z[M];

ll val[M];
ll pref_val[M];

int mx[L][M], pw2[M];

int getmax(int l, int r) {
    int e = pw2[r - l + 1];
    return max(mx[e][l], mx[e][r - (1 << e) + 1]);
}

ll f[M];
ll pref_val2[M];

void solve() {
    cin >> n >> m >> s >> t;
    pref[0] = 0;
    for (int i = 0; i < n; i++) {
        cin >> w[i];
        pref[i + 1] = pref[i] + w[i];
    }

    {
        auto zf = z_function(s + "#" + t);
        for (int i = 0; i < (int)t.size(); i++) {
            z[i] = zf[i + (int)s.size() + 1];
        }
    }

    for (int i = 0; i < n; i++) {
        mx[0][i] = i + z[i];
    }
    for (int k = 1; k < L; k++) {
        for (int i = 0; i < n; i++) {
            int r = (1 << (k - 1)) + i;
            if (r >= n) {
                mx[k][i] = mx[k - 1][i];
                continue;
            }
            mx[k][i] = max(mx[k - 1][i], mx[k - 1][r]);
        }
    }
    pw2[1] = 0;
    for (int i = 2; i <= n; i++) {
        pw2[i] = pw2[i - 1];
        if ((1 << (pw2[i] + 1)) <= i) {
            pw2[i]++;
        }
    }

    for (int i = 0; i < n; i++) {
        val[i] = pref[z[i]];
    }
    pref_val[0] = 0;
    for (int i = 0; i < n; i++) {
        pref_val[i + 1] = pref_val[i] + val[i];
    }

    {
        vector<int> zf = z_function(s);
        pref_val2[0] = 0;
        for (int i = 1; i <= n; i++) {
            pref_val2[i] = pref_val2[i - 1] + pref[zf[i - 1]];
        }
        vector<int> pr = prefix_function(s);
        f[0] = 0;
        for (int k = 1; k <= n; k++) {
            f[k] = pref[k];
            f[k] += f[pr[k - 1]];
            f[k] += pref_val2[k - pr[k - 1]];
        }
    }

    for (int zp = 0; zp < m; zp++) {
        int l, r;
        cin >> l >> r;
        l--;

        if (getmax(l, r - 1) < r) {
            cout << pref_val[r] - pref_val[l] << "\n";
            return;
        }

        int gl = l;
        int gr = r;
        while (gr - gl > 1) {
            int mid = (gl + gr) / 2;
            if (getmax(l, mid - 1) >= r) {
                gr = mid;
            } else {
                gl = mid;
            }
        }

        ll ans = 0;
        ans += pref_val[gl] - pref_val[l];
        ans += f[r - gl];

        cout << ans << "\n";
    }
}

int main() {
#ifdef ONPC
    freopen("input", "r", stdin);
#endif
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    int T = 1;
    //cin >> t;
    while (T--) {
        solve();
    }

    return 0;
}