#include <cstdio>
#include <cstring>
#include <algorithm>
#define ll unsigned long long
using namespace std;

int n,m;
char c[150005];
char s[150005];
ll w[150005];
ll h[150005];
ll sm[150005];
ll sw[150005];
ll sp[150005];
ll hs[150005];
ll bin[150005];
int lg[150005];
int lcp[150005];
int nxt[150005];
int mx[20][150005];

inline void in(int &n){
	n=0;
	char c=getchar();
	while(c<'0' || c>'9') c=getchar();
	while(c>='0'&&c<='9') n=n*10+c-'0',c=getchar();
	return ;
}

inline ll get(int l,int r){return hs[r]-hs[l-1]*bin[r-l+1];}

inline void KMP(){
	int j=0;
	for(int i=2;i<=n;i++){
		while(c[j+1]!=c[i]&&j) j=nxt[j];
		if(c[j+1]==c[i]) j++;
		nxt[i]=j;
	}
	return ;
}

inline int ask(int l,int r){
	int len=lg[r-l+1];
	return max(mx[len][l],mx[len][r-(1<<len)+1]);
}

int main(){
	// freopen("qwq.in","r",stdin);
	// freopen("qwq.out","w",stdout);
	in(n),in(m);
	scanf("%s",c+1);
	scanf("%s",s+1);
	KMP();
	for(int i=1;i<=n;i++){int x;in(x);w[i]=x,sw[i]=sw[i-1]+x;}
	for(int i=1;i<=n;i++){
		int j=i;
		sm[i]=sm[i-1];
		while(j) sm[i]+=w[j],j=nxt[j];
	}
	bin[0]=1;
	for(int i=1;i<=n;i++) bin[i]=bin[i-1]*131;
	for(int i=1;i<=n;i++) h[i]=h[i-1]*131+c[i];
	for(int i=1;i<=n;i++) hs[i]=hs[i-1]*131+s[i];
	for(int i=1;i<=n;i++){
		int l=0,r=n-i,mid;
		while(l<=r){
			mid=(l+r)>>1;
			if(get(i,i+mid)==h[1+mid]) lcp[i]=mid+1,l=mid+1;
			else r=mid-1;
		}
	}
	for(int i=2;i<=n;i++) lg[i]=lg[i>>1]+1;
	for(int i=1;i<=n;i++) mx[0][i]=lcp[i]+i,sp[i]=sp[i-1]+sw[lcp[i]];
	for(int j=1;j<=lg[n];j++)
		for(int i=1;i+(1<<j)-1<=n;i++)
			mx[j][i]=max(mx[j-1][i],mx[j-1][i+(1<<(j-1))]);
	while(m--){
		int L,R;
		in(L),in(R);
		if(ask(L,R)<=R+1){printf("%llu\n",sp[R]-sp[L-1]);continue;}
		int l=L,r=R,mid,pos=0;
		while(l<=r){
			mid=(l+r)>>1;
			if(ask(L,mid)>R+1) pos=mid,r=mid-1;
			else l=mid+1;
		}
		ll ans=sp[pos-1]-sp[L-1];
		ans+=sm[R-pos+1];
		printf("%llu\n",ans);
	}

	return 0;
}