#include<bits/stdc++.h>
#define ll long long
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rof(i,a,b) for(int i=(a);i>=(b);--i)
using namespace std;
const int Maxn=1.5e5;

int n,q,nxt[Maxn+5],p[Maxn+5],h[Maxn+5],fa[Maxn+5];
ll sum[Maxn+5],pr[Maxn+5],val[Maxn+5],ans[Maxn+5],tr[Maxn+5];
char s[Maxn+5],t[Maxn+5]; int st[Maxn+5][20];
vector<pair<int,int>> qr[Maxn+5];

inline void getnxt(char *s,int n)
{
    nxt[1]=n;
    for(int i=2,l=0,r=0;i<=n;++i)
    {
        if(i<=r) nxt[i]=min(r-i+1,nxt[i-l+1]);
        while(i+nxt[i]<=n && s[i+nxt[i]]==s[nxt[i]+1]) nxt[i]++;
        if(i+nxt[i]-1>r) l=i,r=i+nxt[i]-1;
    }
}
inline void exkmp(char *s,char *t,int n,int m)
{
    getnxt(t,m);
    for(int i=1,l=0,r=0;i<=n;++i)
    {
        if(i<=r) p[i]=min(r-i+1,nxt[i-l+1]);
        while(i+p[i]<=n && s[i+p[i]]==t[p[i]+1]) p[i]++;
        if(i+p[i]-1>r) l=i,r=i+p[i]-1;
    }
}
inline int GetMx(int l,int r)
{int len=__lg(r-l+1); return max(st[l][len],st[r-(1<<len)+1][len]);}

int main()
{
    // freopen("1.in","r",stdin);

    scanf("%d%d%s%s",&n,&q,s+1,t+1),exkmp(t,s,n,n);
    For(i,1,n) scanf("%d",&h[i]),sum[i]=sum[i-1]+h[i];
    fa[1]=0,pr[1]=val[1]=h[1]; for(int i=2,j=0;i<=n;++i)
    {
        while(j && s[j+1]!=s[i]) j=fa[j]; if(s[j+1]==s[i]) j++;
        fa[i]=j,val[i]=h[i]+val[j],pr[i]=pr[i-1]+val[i];
    }
    For(i,1,n) st[i][0]=i+p[i]-1;
    For(j,1,19) for(int i=1;i+(1<<j)-1<=n;++i)
        st[i][j]=max(st[i][j-1],st[i+(1<<j-1)][j-1]);
    For(i,1,n) tr[i]=tr[i-1]+sum[p[i]];
    while(q--)
    {
        int L,R; ll ans=0; scanf("%d%d",&L,&R);
        int l=L,r=R+1; while(l<r)
        {
            int mid=(l+r)/2;
            if(GetMx(L,mid)>R) r=mid; else l=mid+1;
        } ans=tr[l-1]-tr[L-1]; if(l<=R) ans+=pr[R-l+1];
        printf("%lld\n",ans);
    }
    return 0;
}