#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector < int > vi ;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

const int MAXN = 2e5 + 7 ;

int n , q ;
string a , b ;
ll pref[ MAXN ] , ori[ MAXN ] ;
ll prec[ MAXN ] , seq[ MAXN ] ;

int PI[ MAXN ] ;
int mx[ MAXN ] ;

class Tree {
public :
    int tr[ 4 * MAXN ] ;
    ll add[ 4 * MAXN ] ;
    void init ( int w , int l , int r ) {
        if ( l == r ) {
            tr[ w ] = l + mx[ l ] - 1 ;
            add[ w ] = pref[ mx[ l ] ] ;
            return ;
        }
        int mid = ( l + r ) / 2 ;
        init ( 2 * w , l , mid ) ;
        init ( 2 * w + 1 , mid + 1 , r ) ;
        tr[ w ] = max ( tr[ 2 * w ] , tr[ 2 * w + 1 ] ) ;
        add[ w ] = add[ 2 * w ] + add[ 2 * w + 1 ] ;
    }
    int get_fst ( int w , int l , int r , int st , int targ ) {
        if ( tr[ w ] <= targ ) { return -1 ; }
        if ( r < st ) { return -1 ; }
        if ( l == r ) { return l ; }
        int mid = ( l + r ) / 2 ;
        int aux = get_fst ( 2 * w , l , mid , st , targ ) ;
        if ( aux != -1 ) { return aux ; }
        return get_fst ( 2 * w + 1 , mid + 1 , r , st , targ ) ;
    }
    ll get_sm ( int w , int l , int r , int st , int en ) {
        if ( l > r || st > en ) { return 0 ; }
        if ( r < st || en < l ) { return 0 ; }
        if ( st <= l && r <= en ) { return add[ w ] ; }
        int mid = ( l + r ) / 2 ;
        return get_sm ( 2 * w , l , mid , st , en ) + get_sm ( 2 * w + 1 , mid + 1 , r , st , en ) ;
    }
};
Tree w ;

struct SuffixArray {
	vi sa, lcp;
	SuffixArray(string& s, int lim=256) { // or basic_string<int>
		int n = sz(s) + 1, k = 0, a, b;
		vi x(all(s)+1), y(n), ws(max(n, lim)), rank(n);
		sa = lcp = y, iota(all(sa), 0);
		for (int j = 0, p = 0; p < n; j = max(1, j * 2), lim = p) {
			p = j, iota(all(y), n - j);
			rep(i,0,n) if (sa[i] >= j) y[p++] = sa[i] - j;
			fill(all(ws), 0);
			rep(i,0,n) ws[x[i]]++;
			rep(i,1,lim) ws[i] += ws[i - 1];
			for (int i = n; i--;) sa[--ws[x[y[i]]]] = y[i];
			swap(x, y), p = 1, x[sa[0]] = 0;
			rep(i,1,n) a = sa[i - 1], b = sa[i], x[b] =
				(y[a] == y[b] && y[a + j] == y[b + j]) ? p - 1 : p++;
		}
		rep(i,1,n) rank[sa[i]] = i;
		for (int i = 0, j; i < n - 1; lcp[rank[i++]] = k)
			for (k && k--, j = sa[rank[i] - 1];
					s[i + k] == s[j + k]; k++);
	}
};


void solve ( ) {
    cin >> n >> q ;
    cin >> a >> b ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        cin >> ori[ i ] ;
        pref[ i ] = ori[ i ] + pref[ i - 1 ] ;
    }
    string wtf = a + '#' + b ;
    SuffixArray aux ( wtf ) ;
    int sz = wtf.size ( ) ;
    int stpos = 0 ;
    for ( int i = 1 ; i <= sz ; ++ i ) {
        if ( aux.sa[ i ] == 0 ) { stpos = i ; }
    }
    int mn = MAXN ;
    for ( int i = stpos - 1 ; i >= 1 ; -- i ) {
        mn = min ( mn , aux.lcp[ i + 1 ] ) ;
        if ( aux.sa[ i ] > n ) {
            mx[ aux.sa[ i ] - n ] = mn ; 
        }
    }
    mn = MAXN ;
    for ( int i = stpos + 1 ; i < sz ; ++ i ) {
        mn = min ( mn , aux.lcp[ i ] ) ;
        if ( aux.sa[ i ] > n ) {
            mx[ aux.sa[ i ] - n ] = mn ; 
        }        
    }
    int l = 0 , r ;
    for ( int i = 2 ; i <= n ; ++ i ) {
        while ( l > 0 && a[ i - 1 ] != a[ l ] ) { l = PI[ l ] ; }
        if ( a[ i - 1 ] == a[ l ] ) { ++ l ; }
        PI[ i ] = l ;
    }
    /**
    l = 0 ;
    for ( int i = 1 ; i <= n ; ++ i ) {
        while ( l > 0 && b[ i - 1 ] != a[ l ] ) { l = PI[ l ] ; }
        if ( b[ i - 1 ] == a[ l ] ) { ++ l ; }
        if ( l > 0 ) {
            mx[ i - l + 1 ] = max ( mx[ i - l + 1 ] , l ) ;
        }
    }
    for ( int i = 1 ; i <= n ; ++ i ) {
        if ( mx[ i ] == 0 ) { continue ; }
        int hh = PI[ mx[ i ] ] ;
        if ( hh > 0 ) {
            mx[ i + ( mx[ i ] - hh ) ] = max ( mx[ i + ( mx[ i ] - hh ) ] , hh ) ;
        }
    }
    **/
    for ( int i = 1 ; i <= n ; ++ i ) {
        seq[ i ] = seq[ PI[ i ] ] + ori[ i ] ; 
        prec[ i ] = prec[ i - 1 ] + seq[ i ] ;
    }
    w.init ( 1 , 1 , n ) ;
    while ( q -- ) {
        cin >> l >> r ;
        int hh = w.get_fst ( 1 , 1 , n , l , r ) ;
        if ( hh == -1 || hh > r ) { hh = r + 1 ; }
        cout << w.get_sm ( 1 , 1 , n , l , hh - 1 ) + prec[ r - hh + 1 ] << "\n" ;
    }
}

int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; // cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}