#include<bits/stdc++.h>
#define ls(x) (x<<1)
#define rs(x) (x<<1|1)
using namespace std;
typedef unsigned long long ull;
constexpr int M=1.5e5+5;char s[M],t[M];
ull hs1[M],hs2[M],ht1[M],ht2[M],pw1[M],pw2[M],w[M],res[M],sum[M];
int n,m,l,r,ans,pos,f[M],nxt[M],tr[M<<2];
int read(){
	int x=0,f=1;char ch=getchar();
	while (!isdigit(ch)) {if (ch=='-') f=-1;ch=getchar();}
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x*f;
}
void build(int l,int r,int x){
	if (l==r) return tr[x]=f[l],void();
	int mid=l+r>>1;
	build(l,mid,ls(x));build(mid+1,r,rs(x));
	tr[x]=max(tr[ls(x)],tr[rs(x)]);
}
int query(int L,int R,int l=1,int r=n,int x=1){
	if (tr[x]<=R) return 0;
	if (l==r) return l; int mid=l+r>>1,ans;
	if (L<=mid&&(ans=query(L,R,l,mid,ls(x)))) return ans;
	if (R>mid&&(ans=query(L,R,mid+1,r,rs(x)))) return ans;
	return 0;
}
int main(){
	n=read();m=read();
	scanf("%s%s",s+1,t+1);
	for (int i=1;i<=n;i++) w[i]=read();
	for (int i=pw1[0]=pw2[0]=1;i<=n;i++) pw1[i]=pw1[i-1]*233,pw2[i]=pw2[i-1]*2333;
	for (int i=1;i<=n;i++) hs1[i]=hs1[i-1]*233+s[i],hs2[i]=hs2[i-1]*2333+s[i];
	for (int i=1;i<=n;i++) ht1[i]=ht1[i-1]*233+t[i],ht2[i]=ht2[i-1]*2333+t[i];
	for (int i=1;i<=n;i++){
		int l=i,r=n;f[i]=i-1;
		while (l<=r){
			int mid=l+r>>1;
			if (hs1[mid-i+1]==ht1[mid]-ht1[i-1]*pw1[mid-i+1]
			  &&hs2[mid-i+1]==ht2[mid]-ht2[i-1]*pw2[mid-i+1])
				f[i]=mid,l=mid+1;
			else r=mid-1; 
		}
	} res[1]=w[1];
	for (int i=2,j=0;i<=n;i++){
		while (j&&s[j+1]!=s[i])
			j=nxt[j];
		nxt[i]=j+=s[j+1]==s[i];
		res[i]=res[nxt[i]]+w[i];
	}
	for (int i=1;i<=n;i++) w[i]+=w[i-1],res[i]+=res[i-1];
	for (int i=1;i<=n;i++) sum[i]=sum[i-1]+w[f[i]-i+1];
	build(1,n,1); while (m--){
		l=read();r=read();
		pos=query(l,r);if (!pos) pos=r+1;
		printf("%llu\n",sum[pos-1]-sum[l-1]+res[r-pos+1]);
	}
	return 0;
}