// This Code was made by Chinese_zjc_.
#include <bits/stdc++.h>
// #define debug
int n, m, skmp[150005], sZ[150005], tZ[150005], ql[150005], qr[150005];
long long w[150005], sum[150005], fsum[150005], ans[150005];
std::string s, t;
std::vector<int> g[150005], q[150005];
std::set<int> app;
void add(int pos, long long val)
{
    ++pos;
    while (pos <= n)
    {
        sum[pos] += val;
        pos += pos & -pos;
    }
}
long long query(int pos)
{
    long long res = 0;
    while (pos)
    {
        res += sum[pos];
        pos -= pos & -pos;
    }
    return res;
}
signed main()
{
    std::ios::sync_with_stdio(false);
    std::cin >> n >> m >> s >> t;
    for (int i = 1; i <= n; ++i)
        std::cin >> w[i], w[i] += w[i - 1];
    for (int i = 1, j = 0; i != n; ++i)
    {
        while (j && s[i] != s[j])
            j = skmp[j];
        skmp[i + 1] = s[i] == s[j] ? ++j : j;
    }
    for (int i = 1; i <= n; ++i)
        fsum[i] = fsum[skmp[i]] + w[i];
    for (int i = 1, pos = 0; i != n; ++i)
    {
        sZ[i] = std::max(0, std::min(sZ[i - pos], pos + sZ[pos] - i));
        while (i + sZ[i] != n && s[sZ[i]] == s[i + sZ[i]])
            ++sZ[i];
        if (i + sZ[i] > pos + sZ[pos])
            pos = i;
    }
    for (int i = 0, pos = 0; i != n; ++i)
    {
        tZ[i] = std::min(sZ[i - pos], pos + tZ[pos] - i);
        while (i + tZ[i] != n && s[tZ[i]] == t[i + tZ[i]])
            ++tZ[i];
        if (i + tZ[i] > pos + tZ[pos])
            pos = i;
        g[i + tZ[i]].push_back(i);
    }
    for (int i = 1; i <= m; ++i)
    {
        std::cin >> ql[i] >> qr[i];
        --ql[i];
        q[qr[i]].push_back(i);
    }
    for (int i = 0; i <= n; ++i)
    {
        app.insert(i);
        for (auto j : g[i])
            app.erase(j), add(j, w[i - j]);
        for (auto j : q[i])
        {
            ans[j] = query(qr[j]) - query(ql[j]);
            std::set<int>::iterator iter = app.lower_bound(ql[j]);
            if (iter != app.end())
                ans[j] += fsum[i - *iter];
        }
    }
    for (int i = 1; i <= m; ++i)
        std::cout << ans[i] << '\n';
    return 0;
}