#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

typedef long double ld;

enum TableType { VAL, ARG };

template <typename T, TableType S = TableType::VAL, typename Cmp = less<T>>
struct sparse_table{
    // VAL returns value, ARG returns position of value
    // less<> for minimum, greater<> for maximum
    // d[i][j] = min(a[i], a[i + 1], ... , a[i + (1 << j) - 1])
    // get(l, r) = min(a[l], a[l + 1], ... , a[r])
    static const int N = 150'000 + 10, L = 20;
    T a[N];
    int d[N][L], rem[N];
    void build(int n, Cmp cmp = {}) {
        for (int i = 1; i <= n; i++) { d[i][0] = i; }
        for (int j = 1; j <= L - 1; j++) {
            for (int i = 1; i <= n; i++) {
                if (i + (1 << j) - 1 > n) { continue; }
                d[i][j] = cmp(a[d[i][j - 1]], a[d[i + (1 << (j - 1))][j - 1]]) ? d[i][j - 1] : d[i + (1 << (j - 1))][j - 1];
            }
        }
        for (int i = 1; i <= n; i++) { rem[i] = log2(i); }
    }
    T get(int l, int r, Cmp cmp = {}) {
        int lg = rem[r - l + 1];
        int pos = cmp(a[d[l][lg]], a[d[r - (1 << lg) + 1][lg]]) ? d[l][lg] : d[r - (1 << lg) + 1][lg];
        if constexpr (S == TableType::VAL) { return a[pos]; } else { return pos; }
    }
};

sparse_table<int, TableType::VAL, greater<>> table;

const int N = 150'000 + 10;
int w[N]; // 1-based
int lcp[N]; // 1-based
ll dp1[N]; // dp1[i] = answer on s[1..i]
ll dp2[N]; // dp2[i] = answer on s[1..i] only of prefixes s[1..j]
ll pref_sum[N]; // pref_sum[i] = \sum_{j = 1}^{i} dp2[lcp[j]]

vector<int> calc_z_func(const string& s) {
    int n = s.size();
    vector<int> z(n, 0);
    for (int i = 1, l = 0, r = 0; i <= n - 1; 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;
}

vector<int> calc_pref_func(const string& s) {
    int n = s.size();
    vector<int> pref(n, 0);
    for (int i = 1, border = 0; i <= n - 1; i++) {
        while (s[border] != s[i] && border) {
            border = pref[border - 1];
        }
        if (s[border] == s[i]) {
            border++;
        }
        pref[i] = border;
    }
    return pref;
}

string pretty_print(const string& s) {
    string res;
    for (char ch : s) {
        res += ch;
        res += ' ';
    }
    if (!res.empty()) {
        res.pop_back();
    }
    return res;
}

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
#endif

    int n, m;
    cin >> n >> m;
    string s, t; // 0-based
    cin >> s >> t;
    for (int i = 1; i <= n; i++) {
        cin >> w[i];
    }

    vector<int> z_func = calc_z_func(s + "$" + t);
    for (int i = 1; i <= n; i++) {
        lcp[i] = z_func[n + i];
    }

    for (int i = 1; i <= n; i++) {
        table.a[i] = i + lcp[i] - 1;
    }
    table.build(n);

    vector<int> pref_func = calc_pref_func(s);
    for (int i = 1; i <= n; i++) {
        dp1[i] = dp1[i - 1] + w[i];
        for (int j = pref_func[i - 1]; j >= 1; j = pref_func[j - 1]) {
            dp1[i] += w[j];
        }

        dp2[i] = dp2[i - 1] + w[i];
    }

    for (int i = 1; i <= n; i++) {
        pref_sum[i] = pref_sum[i - 1] + dp2[lcp[i]];
    }

    // cout << pretty_print(s) << "\n";
    // cout << pretty_print(t) << "\n";

//    for (int i = 1; i <= n; i++) {
//        cout << lcp[i] << " ";
//    }
//    cout << "\n";

//    for (int i = 1; i <= n; i++) {
//        cout << pref_func[i - 1] << " ";
//    }
//    cout << "\n";

//    for (int i = 1; i <= n; i++) {
//        cout << dp1[i] << " ";
//    }
//    cout << "\n";

    while (m--) {
        int l, r;
        cin >> l >> r;
        int x = r + 1;
        if (table.get(l, r) >= r) {
            int lef = l, rig = r;
            while (lef < rig) {
                int mid = (lef + rig) / 2;
                if (table.get(l, mid) >= r) {
                    rig = mid;
                } else {
                    lef = mid + 1;
                }
            }
            x = lef;
        }
        cout << (x <= r ? dp1[r - x + 1] : 0) + pref_sum[x - 1] - pref_sum[l - 1] << "\n";
    }

#ifdef LOCAL
    cout << "\nTime elapsed: " << double(clock()) / CLOCKS_PER_SEC << " s.\n";
#endif
}