#include<bits/stdc++.h>
using namespace std;
const int N = 150000 + 200;
std::vector<int> zFunction(std::string &s) {
    int n = s.size();
    std::vector<int> z(n);
    z[0] = n;
    for (int i = 1, j = 1; i < n; i++) {
        z[i] = std::max(0, std::min(j + z[j] - i, z[i - j]));
        while (i + z[i] < n && s[z[i]] == s[i + z[i]])
            z[i]++;
        if (i + z[i] > j + z[j]) {
            j = i;
        }
    }
    return z;
};
std::vector<int> EXKMP(string &s,string &t)
{
    string tmp = s + '#' + t;
    return zFunction(tmp);
}
int st[20][N];
void solve(){
    int n,m;
    cin>>n>>m;
    string s,t;
    cin>>s>>t;
    auto z = EXKMP(s,t);
    z[0] = n;
    vector<int>z1(n),z2(n);
    vector<long long>W(n),w(n),pre(n + 1),p(n + 1),iz(n),P(n + 1);
    for(int i = 0;i < n;i ++){
        z1[i] = z[i],z2[i] = z[i + n + 1];
    }
    for(int i = 0;i < n;i ++){
        cin>>w[i];W[i] = w[i];
    }
    for(int i = 1;i < n;i ++)
        W[i] += W[i - 1];
    for(int i = 1;i <= n;i ++){
        if(z2[i - 1] == 0)
            pre[i] = pre[i - 1];
        else
            pre[i] = pre[i - 1] + W[z2[i - 1] - 1];
    }
    vector<int>fail(n + 1);
    fail[0] = 0;
    P[0] = w[0];
    for(int i = 1;i < n;i ++){
        int j = fail[i - 1];
        while(j != 0 && s[i] != s[j])
            j = fail[j - 1];
        fail[i] = j + (s[i] == s[j]);
        if(fail[i] > 0)
            P[i] = P[fail[i] - 1] + w[i];
        else
            P[i] = w[i];
    }
    for(int i = 1;i < n;i ++)
    {
        P[i] += P[i - 1];
    }
    for(int i = 0;i < n;i ++){
        if(z2[i] > 0)
            iz[i] = i + z2[i] - 1;
        else
            iz[i] = -1;
    }
    for(int j = 0;j <= 19;j ++)
        for(int i = 0;i < n;i ++)
            st[j][i] = 0;
    for(int i = 0;i < n;i ++)
        st[0][i] = iz[i];
    for(int j = 1;j <= 19;j ++)
        for(int i = 0;i < n;i ++){
            if(i + (1<<(j - 1)) >= n){
                st[j][i] = st[j - 1][i];
                continue;
            }
            st[j][i] = max(st[j - 1][i],st[j - 1][i + (1<<(j - 1))]);
        }
    auto get = [&](int l,int r)->int
    {
        int log = floor(log2(r - l + 1));
        return max(st[log][l],st[log][r - (1<<log) + 1]);   
    };
    for(int i = 1;i <= m;i ++){
        int L,R;
        cin>>L>>R;
        L --,R --;
        if(get(L,R) <= R){
            cout<<pre[R + 1] - pre[L]<<"\n";
        } else {
            if(L + z2[L] - 1 > R){
                cout<<P[R - L]<<"\n";
                continue;
            }
            int l = L,r = R;
            while(l + 1 < r){
                int mid = (l + r) / 2;
                if(get(L,mid) <= R)
                    l = mid;
                else
                    r = mid;
            }
            if(get(L,r) <= R){
                cout<<pre[r] - pre[L] + P[R - r - 1]<<"\n";
            } else {
                cout<<pre[l] - pre[L] + P[R - l - 1]<<"\n";
            }
            
            
        }
    }

    
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
    solve();
}