//A tree without skin will surely die.
//A man without face is invincible.
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define mid ((l+r)>>1)
#define lowbit(x) (x&-x)
#define all(x) (x).begin(),(x).end()
#define rep(i,j,k) for (int i=j;i<=k;++i)
#define per(i,j,k) for (int i=j;i>=k;--i)
#define Tim ((double)clock()/CLOCKS_PER_SEC)
int const N=1.5e5+10;
int n,m,w[N],lcp[N],kmp[N],sm[N],qz[N],gz[N],lg[N],st[20][N],ans[N];string s,t;
struct node{int l,r,id;}q[N];
struct Hash_Table{
    #define ull unsigned long long
    int const B=457;
    int hsh[N],bse[N];
    inline void init(string s){
        s=" "+s,hsh[0]=bse[0]=1;
        rep(i,1,n) hsh[i]=hsh[i-1]*B+s[i]-'a'+233;
        rep(i,1,n) bse[i]=bse[i-1]*B;
    }
    inline ull qry(int l,int r){
        return hsh[r]-hsh[l-1]*bse[r-l+1];
    }
}S,T;
inline int qrymax(int l,int r){
    int k=lg[r-l+1];
    return max(st[k][l],st[k][r-(1<<k)+1]);
}
void solve(){
    cin>>n>>m>>s>>t,S.init(s),T.init(t);
    s=" "+s,t=" "+t;
    rep(i,1,n) cin>>w[i],qz[i]=qz[i-1]+w[i];
    rep(i,1,n){
        int l=1,r=n-i+1,ans=0;
        while (l<=r)
            if (S.qry(1,mid)==T.qry(i,i+mid-1)) l=(ans=mid)+1;
            else r=mid-1;
        lcp[i]=ans;
    }
    rep(i,2,n) lg[i]=lg[i>>1]+1;
    rep(i,1,n) st[0][i]=lcp[i]+i-1;
    rep(j,1,19) rep(i,1,n-(1<<j)+1) st[j][i]=max(st[j-1][i],st[j-1][i+(1<<(j-1))]);
    rep(i,1,n) gz[i]=gz[i-1]+qz[lcp[i]];
    int j=0;sm[1]=qz[1];
    rep(i,2,n){
        while (j && s[j+1]!=s[i]) j=kmp[j];
        if (s[j+1]==s[i]) ++j;
        kmp[i]=j;
        sm[i]=sm[i-1]+w[kmp[i]]+w[i];
    }
    while (m--){
        int x,y;cin>>x>>y;
        int l=x,r=y,ans=x-1;
        while (l<=r)
            if (qrymax(l,mid)<=y) l=(ans=mid)+1;
            else r=mid-1;
        cout<<gz[ans]-gz[x-1]+sm[y-ans]<<'\n';
    }
}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(0),cout.tie(0);
    int t=1;
    // cin>>t;
    while (t--) solve();
    return 0;
}