#include<bits/stdc++.h>
#define all(x) begin(x), end(x)
using namespace std;
using ll = long long;
struct SegTree {
    int n;
    vector<ll> tree;
    SegTree(int n) : n(n), tree(2 * n) {}
    void upd(int p, ll v) {
        // cout << p + n << endl;
        for(tree[p += n] = v; p /= 2;)
            tree[p] = tree[2 * p] + tree[2 * p + 1];
    }
    ll query(ll l, ll r) {
        ll sum = 0;
        for(l += n, r += n; l < r; l >>= 1, r >>= 1) {
            if(l & 1) sum += tree[l++];
            if(r & 1) sum += tree[--r];
        }
        return sum;
    }
};

vector<int> kmp(string s) {
    vector<int> pi(1 + s.size());
    int i = 0, j = pi[0] = -1;
    while(i < s.size()) {
        while(j != -1 && s[j] != s[i])
            j = pi[j];
        pi[++i] = ++j;
    }
    return pi;
}
vector<int> zf(string s) {
    int n = s.size();
    vector<int> z(n);
    int l = 0, r = 0;
    for(int i = 1; i < n; i++) {
        if(i < r) {
            z[i] = min(r - i, z[i - l]);
        }
        while(i + z[i] < n && s[z[i]] == s[i + z[i]]) {
            z[i]++;
        }
        if(i + z[i] > r) {
            l = i;
            r = i + z[i];
        }
    }
    return z;
}
int main() {
    cin.tie(0)->sync_with_stdio(0);
    // for(auto i : zf("abcabcdabcab")) cout << i << " "; cout << endl;
    int n, q;
    string s, t;
    cin >> n >> q >> s >> t;
    vector<ll> w(n);
    for(auto &i : w) cin >> i;
    for(int i = 1; i < n; i++) w[i] += w[i - 1];
    w.insert(w.begin(), 0);
    
    auto par = kmp(s + "#" + t);
    auto pref = zf(s + "#" + t);

    vector<ll> ans(q);
    vector<vector<array<int, 2>>> queries(n);
    vector<vector<array<int, 2>>> queries2(n + 1);
    for(int l, r, i = 0; i < q; i++) {
        cin >> l >> r;
        l--, r--;
        queries[r].push_back({l, i});
        queries2[par[n + 2 + r]].push_back({r - l + 1, i});
    }

    vector<vector<array<int, 2>>> add(n + 1);
    for(int i = 0; i < n; i++) {
        // cout << i << " " << pref[n + 1 + i] << endl;
        if(pref[n + 1 + i]) {
            add[i + pref[n + 1 + i]].push_back({i, w[pref[n + 1 + i]]});
        }
    }

    SegTree st(n);
    for(int i = 0; i < n; i++) {
        for(auto [l, x] : add[i]) {
            // cout << l << " " << i - 1 << "woo" << endl;
            st.upd(l, x);
        }
        for(auto [l, id] : queries[i]) {
            ans[id] = st.query(l, n);
            int t = par[n + 2 + i];
            // while(t) {
            //     // cout << i << " -> " << t << endl;
            //     if(i - t + 1 >= l)
            //         ans[id] += w[t];
            //     t = par[t];
            // }
        }
    }

    vector<vector<int>> g(n + 1);
    for(int i = 1; i <= n; i++) 
        g[par[i]].push_back(i);

    st = SegTree(n + 1);
    auto dfs = [&](auto self, int v) -> void {
        st.upd(v, w[v]);
        for(auto [len, id] : queries2[v]) {
            ans[id] += st.query(0, len + 1);
        }
        for(auto i : g[v]) {
            self(self, i);
        }
        st.upd(v, 0);
    };
    dfs(dfs, 0);

    for(auto i : ans) cout << i << '\n';
}