#include <bits/stdc++.h>
long long read() {
  long long x = 0, f = 1;
  char c = getchar();
  while (c < '0' || c > '9') {
    if (c == '-') f = -1;
    c = getchar();
  }
  while (c >= '0' && c <= '9') {
    x = x * 10 + c - '0';
    c = getchar();
  }
  return f * x;
}
int max(int a, int b) { return a > b ? a : b; }
int min(int a, int b) { return a < b ? a : b; }
void umax(int& a, int t) {
  if (t > a) a = t;
}
bool umin(int& a, int t) {
  if (t < a) return a = t, 1;
  return 0;
}
struct SAM {
  int t[400011][26], pre[400011], len[400011];
  int last, tot;
  SAM() { tot = last = 1; }
  void insert(int w) {
    int pos = last, cur = ++tot;
    len[cur] = len[pos] + 1, last = cur;
    while (pos && !t[pos][w]) t[pos][w] = cur, pos = pre[pos];
    if (!pos) {
      pre[cur] = 1;
      return;
    }
    int nxt = t[pos][w];
    if (len[nxt] == len[pos] + 1)
      pre[cur] = nxt;
    else {
      int tmp = ++tot;
      len[tmp] = len[pos] + 1;
      memcpy(t[tmp], t[nxt], sizeof t[nxt]);
      pre[tmp] = pre[nxt], pre[nxt] = pre[cur] = tmp;
      while (pos && t[pos][w] == nxt) t[pos][w] = tmp, pos = pre[pos];
    }
  }
} sam;
struct Segment_Tree {
  struct node {
    long long sum, k, tag;
  } t[400011 << 2 | 1];
  void pushdown(unsigned l, unsigned r, unsigned num) {
    if (!t[num].tag) return;
    unsigned mid = (l + r) >> 1;
    t[num << 1].sum += t[num << 1].k * t[num].tag,
        t[num << 1].tag += t[num].tag;
    t[num << 1 | 1].sum += t[num << 1 | 1].k * t[num].tag,
        t[num << 1 | 1].tag += t[num].tag;
    t[num].tag = 0;
  }
  void build(int* arr, unsigned l = 1, unsigned r = sam.tot, unsigned num = 1) {
    if (l == r)
      t[num].k = arr[l];
    else {
      unsigned mid = (l + r) >> 1;
      build(arr, l, mid, num << 1), build(arr, mid + 1, r, num << 1 | 1);
      t[num].k = t[num << 1].k + t[num << 1 | 1].k;
    }
  }
  void modify(unsigned ql, unsigned qr, long long k, unsigned l = 1,
              unsigned r = sam.tot, unsigned num = 1) {
    if (ql <= l && r <= qr) {
      t[num].sum += k * t[num].k, t[num].tag += k;
      return;
    }
    pushdown(l, r, num);
    unsigned mid = (l + r) >> 1;
    if (ql <= mid) modify(ql, qr, k, l, mid, num << 1);
    if (qr > mid) modify(ql, qr, k, mid + 1, r, num << 1 | 1);
    t[num].sum = t[num << 1].sum + t[num << 1 | 1].sum;
  }
  long long Qsum(unsigned ql, unsigned qr, unsigned l = 1, unsigned r = sam.tot,
                 unsigned num = 1) {
    if (ql <= l && r <= qr) return t[num].sum;
    pushdown(l, r, num);
    unsigned mid = (l + r) >> 1;
    long long ans = 0;
    if (ql <= mid) ans += Qsum(ql, qr, l, mid, num << 1);
    if (qr > mid) ans += Qsum(ql, qr, mid + 1, r, num << 1 | 1);
    return ans;
  }
} sgt;
struct edge {
  int v, nxt;
} e[400011];
int cnt = 0, last[400011];
void adde(int u, int v) { e[++cnt].v = v, e[cnt].nxt = last[u], last[u] = cnt; }
int size[400011], fa[400011], mson[400011], dep[400011];
void dfs1(int u, int now_dep = 1) {
  size[u] = 1, dep[u] = now_dep;
  for (int i = last[u]; i; i = e[i].nxt) {
    int v = e[i].v;
    fa[v] = u, dfs1(v, now_dep + 1);
    if (size[v] > size[mson[u]]) mson[u] = v;
    size[u] += size[v];
  }
}
int top[400011], dfn[400011], w[400011], cur = 0;
void dfs2(int u, int now_top) {
  top[u] = now_top, dfn[u] = ++cur, w[cur] = sam.len[u] - sam.len[fa[u]];
  if (mson[u]) dfs2(mson[u], now_top);
  for (int i = last[u]; i; i = e[i].nxt)
    if (e[i].v != mson[u]) dfs2(e[i].v, e[i].v);
}
void add_to_root(int u, int k) {
  while (u) sgt.modify(dfn[top[u]], dfn[u], k), u = fa[top[u]];
}
long long Qsum_to_root(int u) {
  long long res = 0;
  while (u) res += sgt.Qsum(dfn[top[u]], dfn[u]), u = fa[top[u]];
  return res;
}
int ed[400011], a[400011], b[400011];
char s[400011];
int main() {
  int n = read(), m = read();
  scanf("%s", s + 1);
  for (int i = n; i; --i) sam.insert(s[i] - 'a'), ed[i] = sam.last;
  for (int i = 2; i <= sam.tot; ++i) adde(sam.pre[i], i);
  dfs1(1), dfs2(1, 1), sgt.build(w);
  while (m--) {
    int k = read(), l = read();
    long long ans = 0;
    for (int i = 1; i <= k; ++i) a[i] = read();
    for (int i = 1; i <= l; ++i) b[i] = read(), add_to_root(ed[b[i]], 1);
    for (int i = 1; i <= k; ++i) ans += Qsum_to_root(ed[a[i]]);
    for (int i = 1; i <= l; ++i) add_to_root(ed[b[i]], -1);
    printf("%lld\n", ans);
  }
  return 0;
}
