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

int n,m;
char c[150005];
char s[150005];
ll h[150005];
ll hs[150005];
ll bin[150005];
ll w[150005];
int lcp[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];}

int main(){
	// freopen("qwq.in","r",stdin);
	in(n),in(m);
	scanf("%s",c+1);
	scanf("%s",s+1);
	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=1;i<=n;i++){int x;in(x);w[i]=w[i-1]+x;}
	while(m--){
		int l,r;
		in(l),in(r);
		ll ans=0;
		for(int i=l;i<=r;i++) ans+=w[min(r-i+1,lcp[i])];
		printf("%lld\n",ans);
	}

	return 0;
}