#include <bits/stdc++.h>
using namespace std;
const int inf = 0x3f3f3f3f;
const long long INF = 0x3f3f3f3f3f3f3f3f;
const int N = 2e5;
int n, m, an, bn, a[N + 7], b[N + 7];
long long ans;
char s[N + 7];
int sc, c[N + 7], tp[N + 7], rk[N + 7], sa[N + 7], h[N + 7];
void csort() {
  for (int i = 0; i <= sc; i++) c[i] = 0;
  for (int i = 1; i <= n; i++) c[rk[i]]++;
  for (int i = 1; i <= sc; i++) c[i] += c[i - 1];
  for (int i = n; i >= 1; i--) sa[c[rk[tp[i]]]--] = tp[i];
}
void buildsa() {
  for (int i = 1; i <= n; i++) rk[i] = s[i], tp[i] = i;
  sc = 128, csort();
  for (int w = 1, p = 0, i; p < n; w <<= 1, sc = p) {
    for (p = 0, i = n - w + 1; i <= n; i++) tp[++p] = i;
    for (i = 1; i <= n; i++)
      if (sa[i] > w) tp[++p] = sa[i] - w;
    csort(), swap(rk, tp), rk[sa[1]] = p = 1;
    for (i = 2; i <= n; rk[sa[i]] = p, i++)
      if (tp[sa[i]] != tp[sa[i - 1]] || tp[sa[i] + w] != tp[sa[i - 1] + w]) p++;
  }
  for (int i = 1, j, k = 0; i <= n; h[rk[i++]] = k)
    for (k = k ? k - 1 : k, j = sa[rk[i] - 1]; s[i + k] == s[j + k]; k++)
      ;
}
int st[20][N + 7];
void buildst() {
  for (int i = 1; i <= n; i++) st[0][i] = h[i];
  for (int j = 1; j <= 18; j++)
    for (int i = 1; i + (1 << j) - 1 <= n; i++)
      st[j][i] = min(st[j - 1][i], st[j - 1][i + (1 << (j - 1))]);
}
int stget(int l, int r) {
  int lg = log2(r - l + 1);
  return min(st[lg][l], st[lg][r - (1 << lg) + 1]);
}
int lcp(int l, int r) {
  if (l == r) return n - l + 1;
  l = rk[l], r = rk[r];
  if (l > r) l ^= r ^= l ^= r;
  return stget(l + 1, r);
}
const int T = N << 2;
struct node {
  int l, r, mx, mn;
  long long sm;
  node(int lp = 0, int rp = 0, int xm = 0, int nm = 0, long long ms = 0) {
    l = lp, r = rp, mx = xm, mn = nm, sm = ms;
  }
  node operator+(const node q) {
    return node(l, q.r, max(mx, q.mx), min(mn, q.mn), sm + q.sm);
  }
};
int mk[T + 7];
node v[T + 7];
void pushup(int k) { v[k] = v[k << 1] + v[k << 1 | 1]; }
void uni(int k, int first) {
  v[k].mn = v[k].mx = first, v[k].sm = (long long)first * (v[k].r - v[k].l + 1),
  mk[k] = first;
}
void pushdown(int k) {
  if (~mk[k]) uni(k << 1, mk[k]), uni(k << 1 | 1, mk[k]), mk[k] = -1;
}
void buildsm(int k, int first, int second) {
  mk[k] = -1, v[k].l = first, v[k].r = second;
  if (first == second) return uni(k, 0);
  buildsm(k << 1, first, ((first + second) >> 1)),
      buildsm(k << 1 | 1, ((first + second) >> 1) + 1, second), pushup(k);
}
void press(int k, int first) {
  if (v[k].mx <= first) return;
  if (v[k].mn >= first) return mk[k] = first, uni(k, first);
  pushdown(k), press(k << 1, first), press(k << 1 | 1, first), pushup(k);
}
void fix(int k, int first, int second) {
  if (v[k].l == v[k].r) return uni(k, second);
  pushdown(k);
  if (((v[k].l + v[k].r) >> 1) >= first)
    fix(k << 1, first, second);
  else
    fix(k << 1 | 1, first, second);
  pushup(k);
}
int main() {
  scanf("%d%d%s", &n, &m, &s[1]);
  buildsa(), buildst();
  for (int mi = 1; mi <= m; mi++) {
    scanf("%d%d", &an, &bn), ans = 0;
    for (int i = 1; i <= an; i++) scanf("%d", &a[i]);
    for (int i = 1; i <= bn; i++) scanf("%d", &b[i]);
    sort(a + 1, a + an + 1,
         [&](int first, int second) { return rk[first] < rk[second]; });
    sort(b + 1, b + bn + 1,
         [&](int first, int second) { return rk[first] < rk[second]; });
    buildsm(1, 1, an);
    for (int i = 1, j = 1; j <= bn; j++) {
      press(1, lcp(b[j - 1], b[j]));
      for (; i <= an && rk[a[i]] <= rk[b[j]]; i++) fix(1, i, lcp(a[i], b[j]));
      ans += v[1].sm;
    }
    buildsm(1, 1, an);
    for (int i = an, j = bn; j >= 1; j--) {
      press(1, lcp(b[j + 1], b[j]));
      for (; i >= 1 && rk[a[i]] > rk[b[j]]; i--) fix(1, i, lcp(a[i], b[j]));
      ans += v[1].sm;
    }
    printf("%lld\n", ans);
  }
  return 0;
}
