#include<iostream>
#include<stdio.h>
#include<ctype.h>
#include<string.h>
#include<vector>
#define ll long long
#define ld long double
#define fi first
#define se second
#define lowbit(x) ((x)&-(x))
#define popcount(x) __builtin_popcount(x)
#define inf 0x3f3f3f3f
#define infll 0x3f3f3f3f3f3f3f3f
#define umap unordered_map
#define all(x) x.begin(),x.end()
#define mk make_pair
#define pb push_back
#define ckmax(x,y) x=max(x,y)
#define ckmin(x,y) x=min(x,y)
#define rep(i,l,r) for(int i=l;i<=r;++i)
#define per(i,r,l) for(int i=r;i>=l;--i)
#define int long long
#define pii pair<int,int>
using namespace std;
inline int read(){
	int x=0,f=0; char ch=getchar();
	while(!isdigit(ch)) f|=(ch==45),ch=getchar();
	while(isdigit(ch)) x=(x<<3)+(x<<1)+(ch^48),ch=getchar();
	return f?-x:x;
}
#define N 150005
int ans[N],nxt[N],n,m,w[N],sw[N],mth[N],fa[N][18],sum[N],c[N],z[N];
char S[2*N],T[N];
vector<pii> qry[N];
inline void update(int x,int v){
	for(int i=x;i<=n;i+=lowbit(i)) c[i]+=v;
}
inline int query(int x){
	int res=0;
	for(int i=x;i;i-=lowbit(i)) res+=c[i];
	return res;
}
signed main(){
	n=read(),m=read();
	scanf("%s%s",S+1,T+1);
	for(int i=1;i<=n;++i) w[i]=read(),sw[i]=sw[i-1]+w[i];
	sum[1]=sw[1];
	for(int i=2,j=0;i<=n;++i){
		while(j && S[j+1]!=S[i]) j=nxt[j];
		if(S[j+1]==S[i]) j++;
		nxt[i]=j;
		fa[i][0]=j;
		sum[i]=sum[nxt[i]]+sw[i];
	}
	for(int j=1;j<=17;++j){
		for(int i=1;i<=n;++i){
			fa[i][j]=fa[fa[i][j-1]][j-1];
		}
	}
	for(int i=1,j=0;i<=n;++i){
		while(j && S[j+1]!=T[i]) j=nxt[j];
		if(S[j+1]==T[i]) j++;
		mth[i]=j;
	}
	for(int i=1;i<=m;++i){
		int l=read(),r=read();
		int p=mth[r];
		if(p>r-l+1){
			for(int j=17;~j;--j){
				if(fa[p][j]>r-l+1) p=fa[p][j];
			}
			p=fa[p][0];
		}
		ans[i]=sum[p];
		qry[l].pb({r,i});
	}
	S[n+1]='#';
	for(int i=1;i<=n;++i) S[n+i+1]=T[i];
	for(int i=2,l=0,r=0;i<=2*n+1;++i){
		if(r>=i) z[i]=min(z[i-l+1],r-i+1);
		while(i+z[i]<=2*n+1 && S[i+z[i]]==S[z[i]+1]) z[i]++;
		if(i+z[i]-1>r) r=i+z[i]-1,l=i;
	}
	for(int i=n;i>=1;--i){
		update(i+z[n+i+1],sw[z[n+i+1]]);
		for(auto v:qry[i]){
			ans[v.se]+=query(v.fi);
		}
	}
	for(int i=1;i<=m;++i) printf("%lld\n",ans[i]);
	return 0;
}