//1L1YA
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2")
using namespace std;
#define ll           long long
#define Pb           push_back
#define dokme(x)     cout << x << endl, exit(0)
#define pll          pair<ll,ll>
#define F            first
#define S            second
#define endl         '\n'
#define sep          ' '
#define all(x)       x.begin(),x.end()
#define FastIO       ios::sync_with_stdio(0);cin.tie(0);cout.tie(0);
#define lc           id<<1
#define rc           lc|1

const ll mod=1e9+7;
const ll oo=4e18;
const int N=3e5+5;
const int lg=23;

ll n,q,a[N],z[N],dp[N],sum[N],lps[N],cnt[N];
pll seg[N<<2];
vector<int> adj[N];
string s,t;

void Z(string s){
    ll m=s.length();
    ll k=0,mx=0;
    for(int i=0;i<m;i++){
        if(i<mx)
            z[i]=min(mx-i,z[i-k]);
        while(i+z[i]<m && s[z[i]]==s[i+z[i]])
            z[i]++;
        if(i+z[i]>mx)
            mx=i+z[i],k=i;
    }
}

void KMP(string s){
    int i=1,j=0;
    int n=s.length();
    while(i<n)
        if(s[i]==s[j])
            lps[i++]=++j;
        else if(j)
            j=lps[j-1];
        else
            lps[i++]=0;
}

void modify(int pos,pll val,int id=1,int l=1,int r=n+1){
    if(r-l==1){
        seg[id]=val;
        return;
    }
    int mid=l+r>>1;
    if(pos<mid)    modify(pos,val,lc,l,mid);
    else    modify(pos,val,rc,mid,r);
    seg[id].F=max(seg[lc].F,seg[rc].F);
    seg[id].S=seg[lc].S+seg[rc].S;
}

pll get(int ql,int qr,int id=1,int l=1,int r=n+1){
    if(qr<=l || ql>=r)    return {0,0};
    if(ql<=l && r<=qr)    return seg[id];
    int mid=l+r>>1;
    pll pl=get(ql,qr,lc,l,mid),pr=get(ql,qr,rc,mid,r);
    return {max(pl.F,pr.F),pl.S+pr.S};
}

void dfs(int v){
    cnt[v]+=a[v];
    for(int u: adj[v]){
        cnt[u]=cnt[v];
        dfs(u);
    }
}

int main(){
    FastIO

    cin >> n >> q >> s >> t;
    for(int i=1;i<=n;i++)
        cin >> a[i],sum[i]=sum[i-1]+a[i];
    Z(s+'#'+t);
    for(int i=1;i<=n;i++)
        modify(i,{i+z[i+n],sum[z[i+n]]});
    KMP(s);
    for(int i=0;i<n;i++)
        adj[lps[i]].Pb(i+1);
    dfs(0);
    for(int i=1;i<=n;i++)
        dp[i]=dp[i-1]+cnt[i];
    while(q--){
        int l,r;
        cin >> l >> r;
        int L=l-1,R=r+1;
        while(R-L>1){
            int mid=L+R>>1;
            if(get(l,mid+1).F<=r)   L=mid;
            else    R=mid;
        }
        cout << (l==R?0:get(l,R).S)+dp[r-L] << endl;
    }

    return 0;
}