#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using pii = pair<int, int>;
#define fi first
#define se second
#define TIME 1e3 * clock() / CLOCKS_PER_SEC
bool Mbe;
constexpr int N = 1e6 + 5;
constexpr int K = 20;
constexpr int S = 26;
namespace SA {
  int n, lg[N], sa[N], rk[N], ork[N], buc[N], id[N], mi[K][N];
  bool cmp(int a, int b, int w) {return ork[a] == ork[b] && ork[a + w] == ork[b + w];}
  void build(int n, char *s) {
    SA::n = n;
    int m = 1 << 7, p = 0;
    for(int i = 1; i <= n; i++) buc[rk[i] = s[i]]++;
    for(int i = 1; i <= m; i++) buc[i] += buc[i - 1];
    for(int i = n; i; i--) sa[buc[rk[i]]--] = i;
    for(int w = 1; ; w <<= 1, m = p, p = 0) {
      for(int i = n - w + 1; i <= n; i++) id[++p] = i;
      for(int i = 1; i <= n; i++) if(sa[i] > w) id[++p] = sa[i] - w;
      memset(buc, 0, sizeof(buc));
      memcpy(ork, rk, sizeof(rk));
      p = 0;
      for(int i = 1; i <= n; i++) buc[rk[i]]++;
      for(int i = 1; i <= m; i++) buc[i] += buc[i - 1];
      for(int i = n; i; i--) sa[buc[rk[id[i]]]--] = id[i];
      for(int i = 1; i <= n; i++) rk[sa[i]] = cmp(sa[i - 1], sa[i], w) ? p : ++p;
      if(p == n) break;
    }
    for(int i = 2; i <= n; i++) lg[i] = lg[i >> 1] + 1;
    for(int i = 1, k = 0; i <= n; i++) {
      if(k) k--;
      while(s[i + k] == s[sa[rk[i] - 1] + k]) k++;
      mi[0][rk[i]] = k;
    }
    for(int i = 1; i <= lg[n]; i++)
      for(int j = 1; j + (1 << i) - 1 <= n; j++)
        mi[i][j] = min(mi[i - 1][j], mi[i - 1][j + (1 << i - 1)]);
  }
  int lcp(int x, int y) {
    if(x == y) return n - x + 1;
    if((x = rk[x]) > (y = rk[y])) swap(x, y);
    int d = lg[y - x++];
    return min(mi[d][x], mi[d][y - (1 << d) + 1]);
  }
  int lcp(int a, int b, int c, int d) {return min(min(b - a, d - c) + 1, lcp(a, c));}
}
namespace SAM {
  int cnt = 1, las = 1, s[N];
  int fa[N], len[N], son[N][S];
  int sz[N], lst[N], pos[N];
  void ins(int it) {
    int cur = ++cnt, p = las;
    las = cur;
    len[cur] = len[p] + 1;
    pos[len[cur]] = cur;
    sz[cur] = 1;
    s[len[cur]] = it;
    while(!son[p][it]) son[p][it] = cur, p = fa[p];
    if(!p) return fa[cur] = 1, void();
    int q = son[p][it];
    if(len[p] + 1 == len[q]) return fa[cur] = q, void();
    int cl = ++cnt;
    memcpy(son[cl], son[q], S << 2);
    fa[cl] = fa[q], fa[q] = fa[cur] = cl;
    len[cl] = len[p] + 1;
    while(son[p][it] == q) son[p][it] = cl, p = fa[p];
  }
  bool vis[N];
  ll f[N], g[N];
  vector<int> e[N], G[N], R[N];
  void calc(int id) {
    lst[id] = len[id];
    for(int it : e[id]) calc(it), sz[id] += sz[it], lst[id] = lst[it]; 
  }
  ll calcf(int id) {
    if(vis[id]) return f[id];
    vis[id] = f[id] = 1;
    for(int it : G[id]) f[id] += calcf(it);
    return f[id];
  }
  ll calcg(int id) {
    if(vis[id]) return g[id];
    vis[id] = g[id] = 1;
    for(int it : R[id]) g[id] += calcg(it);
    return g[id];
  }
  int to[N], tag[N];
  int dn, dfn[N], rev[N], top[N];
  int end[N], l[N], r[N];
  void dfs(int id, int tp) {
    rev[dfn[id] = ++dn] = id;
    top[id] = tp;
    end[id] = id;
    if(to[id]) dfs(to[id], tp), end[id] = end[to[id]];
    if(id == tp) r[id] = lst[end[id]], l[id] = r[id] - (dfn[end[id]] - dfn[id]) + 1;
    for(int it : G[id]) if(!dfn[it] && !tag[it]) dfs(it, it);
  }
  void build() {
    for(int i = 2; i <= cnt; i++) e[fa[i]].push_back(i);
    calc(1);
    for(int i = 1; i <= cnt; i++)
      for(int j = 0; j < S; j++)
        if(son[i][j]) {
          G[i].push_back(son[i][j]);
          R[son[i][j]].push_back(i);
        }
    for(int i = 1; i <= cnt; i++) calcf(i);
    memset(vis, 0, sizeof(vis));
    for(int i = 1; i <= cnt; i++) calcg(i);
    for(int i = 1; i <= cnt; i++) {
      for(int it : G[i])
        if(2 * f[it] > f[i] && 2 * g[i] > g[it])
          to[i] = it, tag[it] = 1;
    }
    dfs(1, 1);
  }
  vector<pii> get(int x, int y) {
    int p = 1;
    vector<pii> ret;
    while(1) {
      int L = l[top[p]], R = r[top[p]];
      L += dfn[p] - dfn[top[p]];
      if(L <= R) {
        int mat = SA::lcp(L, R, x, y);
        ret.push_back({dfn[p], dfn[p] + mat});
        x += mat, p = rev[dfn[p] + mat];
      }
      else ret.push_back({dfn[p], dfn[p]});
      if(x <= y) {
        if(to[p] == son[p][s[x]]) exit(0);
        p = son[p][s[x++]];
      }
      else break;
    }
    return ret;
  }
}
int n, q, f[N];
char s[N];
vector<pii> seq[N];
vector<int> buc[N];
ll ans[N];
struct BIT {
  ll c[N];
  void add(int x, int v) {while(x <= SAM::cnt) c[x] += v, x += x & -x;}
  ll query(int x) {ll s = 0; while(x) s += c[x], x -= x & -x; return s;}
  ll query(int l, int r) {return query(r) - query(l - 1);}
} tr;
void solve(int id) {
  if(id > 1) tr.add(SAM::dfn[id], f[SAM::sz[id]]);
  for(int it : buc[id]) for(pii I : seq[it]) ans[it] += tr.query(I.fi, I.se);
  for(int it : SAM::e[id]) solve(it);
  if(id > 1) tr.add(SAM::dfn[id], -f[SAM::sz[id]]);
}
bool Med;
int main() {
  fprintf(stderr, "%.3lf MB\n", (&Mbe - &Med) / 1048576.0);
  #ifdef ALEX_WEI
    FILE* IN = freopen("1.in", "r", stdin);
    FILE* OUT = freopen("1.out", "w", stdout);
  #endif
  ios::sync_with_stdio(0);
  cin >> n >> q >> s + 1;
  for(int i = 1; i <= n; i++) cin >> f[i];
  for(int i = 1; i <= n; i++) SAM::ins(s[i] - 'a');
  SA::build(n, s);
  SAM::build();
  for(int i = 1; i <= q; i++) {
    int l, r;
    cin >> l >> r;
    buc[SAM::pos[r]].push_back(i);
    seq[i] = SAM::get(l, r);
  }
  solve(1);
  for(int i = 1; i <= q; i++) cout << ans[i] << "\n";
  cerr << TIME << " ms\n";
  return 0;
}