#include <bits/stdc++.h>

using namespace std;

typedef long long int	ll;
typedef pair<int, int>	pii;
typedef pair<ll, ll>	pll;


#define F		        first
#define S		        second
#define pb		        push_back
#define endl            '\n'
#define Mp		        make_pair
#define all(x)          x.begin(), x.end()
#define debug(x)        cerr << #x << " = " << x << endl;
#define fast_io         ios::sync_with_stdio(false);cin.tie(0);cout.tie(0);
#define file_io         freopen("connect.in" , "r" , stdin) ; freopen("connect.out" , "w" , stdout);


ll mod = 1e9+7;

const int N = 3e5+23;
string s, t;
ll w[N];
int LPS[N];
int z[N];
ll prefz[N];
ll prefkmp[N];
ll prefpref[N];
ll prefw[N];
int n, m;
vector<pii> Q[N];
ll ans[N];
vector<int> out[N];
set<int>st;


int main()
{
    fast_io
    cin>>n>>m;
    cin>>s>>t;
    string p;
    p=s+'#'+t;
    for (int i=1; i<=n; i++) cin>>w[i];
    for (int i=1; i<=n; i++) prefw[i]=prefw[i-1]+w[i];

    for (int i=1, j=0; i<n; i++){
        while(j>0 && s[i]!=s[j])j=LPS[j-1];
        if(s[j]==s[i]) j++;
        LPS[i]=j;
    }

    int Mx=0, ind=0;
    for (int i=1; i<=2*n; i++){
        if(Mx>i) z[i]=min(Mx-i, z[i-ind]);
        while(z[i]+i<=2*n && p[z[i]+i]==p[z[i]])z[i]++;
        if(z[i]>Mx){
            Mx=z[i];
            ind=i;
        }
    }
    for (int i=n; i<=2*n; i++) prefz[i]=prefz[i-1]+prefw[z[i]];
    for (int i=0; i<n; i++){
        prefpref[i+1]=w[i+1]+prefpref[LPS[i]];
        prefkmp[i+1]=prefpref[i+1]+prefkmp[i];
    }
    for (int i=n; i<=2*n; i++){
        if(z[i]) {
            st.insert(i);
            out[z[i]+i].pb(i);
        }
    }

    for (int i=0; i<m; i++){
        int l, r; cin>>l>>r; l+=n; r+=n;
        Q[r].pb({l, i});
    }

    for (int i=n; i<=2*n; i++){

        for (int j: out[i]) st.erase(j);
        for (auto pp: Q[i]){
            int l=pp.F, ind=pp.S;
            auto x=st.lower_bound(l);
            if(x==st.end() || *x>i){
                ans[ind]=prefz[i]-prefz[l-1];
                continue;
            }
            ans[ind]=prefz[*x-1]-prefz[l-1]+prefkmp[i-*x+1];
        }
    }
    for (int i=0; i<m; i++) cout<<ans[i]<<endl;
}