#include<bits/stdc++.h>
using namespace std;
using ll=long long;
const int N=1.5e5;
int n,m;
char s[N+5],t[N+5];
ll w[N+5];
int zs[N+5],zt[N+5];
int pre[N+5];
ll sw[N+5],wt[N+5];
void prep(){
	for(int i=2,j=1,r=1;i<=n;i++){
		int &k=zs[i]=r>i?zs[i-j+1]:0;
		while(i+k<=n&&s[i+k]==s[k+1]) k++;
		if(i+k>r){
			j=i; r=i+k;
		}
	}
	for(int i=1;i<=n;i++){
		pre[i]=i;
		if(pre[i-1]+zs[pre[i-1]]>i+zs[i])
			pre[i]=pre[i-1];
	}
	sw[1]=w[1];
	for(int i=2;i<=n;i++){
		int l=1,r=i-1,mid,p;
		sw[i]=w[i]-w[i-1];
		while(l<=r){
			mid=l+r>>1; p=pre[mid];
			if(p+zs[p]>i) r=mid-1;
			else l=mid+1;
		}
		p=r+1;
		if(p==i) sw[i]+=w[zs[i]>0];
		else sw[i]+=sw[i-p+1];
	}
	for(int i=1;i<=n;i++) sw[i]+=sw[i-1];
	for(int i=1,j=0,r=0;i<=n;i++){
		int &k=zt[i]=r>i?zs[i-j+1]:0;
		while(i+k<=n&&t[i+k]==s[k+1]) k++;
		if(i+k>r){
			j=i; r=i+k;
		}
		wt[i]=w[k];
	}
	for(int i=1;i<=n;i++) wt[i]+=wt[i-1];
}
namespace Segtr{
	int tr[N*4+5];
	#define lc id<<1
	#define rc id<<1|1
	void build(int l,int r,int id){
		if(l==r){
			tr[id]=l+zt[l]-1;
			return;
		}
		int mid=l+r>>1;
		build(l,mid,lc);
		build(mid+1,r,rc);
		tr[id]=max(tr[lc],tr[rc]);
	}
	int query(int l,int r,int st,int en,int id){
		if(tr[id]<=en) return -1;
		if(l==r) return l;
		int mid=l+r>>1,ans=-1;
		if(st<=mid) ans=query(l,mid,st,en,lc);
		if(ans==-1&&en>mid) ans=query(mid+1,r,st,en,rc);
		return ans;
	}
}
using namespace Segtr;
int main(){
	scanf("%d %d",&n,&m);
	scanf("%s",s+1);
	scanf("%s",t+1);
	for(int i=1;i<=n;i++){
		scanf("%lld",&w[i]);
		w[i]+=w[i-1];
	}
	prep();
	build(1,n,1);
	while(m--){
		int l,r;
		scanf("%d %d",&l,&r);
		int p=query(1,n,l,r,1);
		if(p==-1) printf("%lld\n",wt[r]-wt[l-1]);
		else printf("%lld\n",wt[p-1]-wt[l-1]+sw[r-p+1]);
	}
	return 0;
}