#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXN = 3e5+10,base = 13331;
typedef array<ll,2> pr;

int n,m;
char s[MAXN],t[MAXN];
ll w[MAXN],ans[MAXN],sum[MAXN],psum[MAXN];

vector<pr>q[MAXN];
vector<int>add[MAXN];

ull pw[MAXN],hs[MAXN],h[MAXN];
ull qh(int l,int r){
	return h[r]-h[l-1]*pw[r-l+1];
}
struct BIT{
	ll t[MAXN];
	void mdf(int x,ll v){x=n-x+1;for(;x<=n;x+=lowbit(x))t[x]+=v;}
	ll qry(int x,ll S=0){x=n-x+1;for(;x;x-=lowbit(x))S+=t[x];return S;}
}bit;

int nxt[MAXN][20],f[MAXN];

void kmp(){
	int j=0;
	psum[1]=sum[1];
	rep(i,2,n){
		while(j && s[j+1]!=s[i])j=nxt[j][0];
		if(s[j+1]==s[i])j++;
		nxt[i][0]=j;
		psum[i]=sum[i]+psum[j];
	}
	rep(j,1,19)rep(i,1,n)nxt[i][j] = nxt[nxt[i][j-1]][j-1];
	//
	j=0;
	rep(i,1,n){
		while(j && (j==n || s[j+1]!=t[i]))j=nxt[j][0];
		if(s[j+1]==t[i])j++;
		f[i]=j;
	}
}

int main(){
	ios::sync_with_stdio(false);

	cin>>n>>m>>(s+1)>>(t+1);
	rep(i,1,n)cin>>w[i],sum[i]=sum[i-1]+w[i];

	kmp();

	rep(i,1,m){
		int l,r;cin>>l>>r;
		int p = f[r];
		per(j,19,0)if(nxt[p][j] > r-l+1)p=nxt[p][j];
		if(p>r-l+1)p=nxt[p][0];

		ans[i]=psum[p];
		q[r].push_back({l,i});
	}

	pw[0]=1;rep(i,1,n)pw[i]=pw[i-1]*base;
	rep(i,1,n)hs[i]=hs[i-1]*base+(s[i]-'a'+1);
	rep(i,1,n)h[i]=h[i-1]*base+(t[i]-'a'+1);

	rep(i,1,n){
		int L = 1,R = n-i+1,ret = 0;
		while(L<=R){
			int mid = (L+R)>>1;
			if(qh(i,i+mid-1) == hs[mid])ret=mid,L=mid+1;
			else R=mid-1;
		}
		add[i+ret].push_back(i);
	}
	rep(i,1,n){
		for(auto j:add[i])bit.mdf(j,sum[i-j]);
		for(auto [j,id]:q[i])ans[id] += bit.qry(j);
	}

	rep(i,1,m)cout<<ans[i]<<"\n";
    return 0;
}