#include <bits/stdc++.h>
using namespace std;
const int N = 4e5 + 10;
int c[N], sa[N], x[N], y[N], rk[N], hei[N], he[N], n, m, cc[N << 1], st[N][20],
    a[N], h[N], T, b[N];
long long dp[N];
char s[N];
bool cmp(int x, int y) { return rk[x] < rk[y]; }
void get_sa() {
  for (int i = 1; i <= n; i++) ++c[x[i] = s[i]];
  for (int i = 2; i <= m; i++) c[i] += c[i - 1];
  for (int i = n; i >= 1; i--) sa[c[x[i]]--] = i;
  for (int k = 1; k <= n; k <<= 1) {
    int num = 0;
    for (int i = n - k + 1; i <= n; i++) y[++num] = i;
    for (int i = 1; i <= n; i++)
      if (sa[i] > k) y[++num] = sa[i] - k;
    for (int i = 1; i <= m; i++) c[i] = 0;
    for (int i = 1; i <= n; i++) ++c[x[i]];
    for (int i = 2; i <= m; i++) c[i] += c[i - 1];
    for (int i = n; i >= 1; i--) sa[c[x[y[i]]]--] = y[i], y[i] = 0;
    swap(x, y);
    x[sa[1]] = 1;
    num = 1;
    for (int i = 2; i <= n; i++)
      x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k])
                     ? num
                     : ++num;
    if (num == n) break;
    m = num;
  }
}
void get_h() {
  memset(hei, 0, sizeof(hei));
  for (int i = 1; i <= n; i++) rk[sa[i]] = i;
  int k = 0;
  for (int i = 1; i <= n; i++) {
    if (rk[i] == 1) continue;
    if (k) k--;
    int j = sa[rk[i] - 1];
    while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k++;
    hei[rk[i]] = k;
    st[rk[i]][0] = k;
  }
}
int lcp(int l, int r, int len) {
  if (l == r) return len - l + 1;
  int x = rk[l], y = rk[r];
  if (x > y) swap(x, y);
  x++;
  int k = log2(y - x + 1);
  return min(st[x][k], st[y - (1 << k) + 1][k]);
}
long long work(int len) {
  sort(a + 1, a + len + 1, cmp);
  for (int i = 2; i <= len; i++) he[i] = lcp(a[i], a[i - 1], n);
  int top = 0;
  long long ans = 0;
  for (int i = 1; i <= len; i++) {
    while (top > 0 && he[h[top]] >= he[i]) top--;
    int p = h[top];
    dp[i] = dp[p] + (long long)(i - p) * he[i];
    ans += dp[i];
    h[++top] = i;
  }
  for (int i = 1; i <= len; i++) dp[i] = 0, h[i] = 0, he[i] = 0;
  return ans;
}
int main() {
  scanf("%d%d", &n, &T);
  scanf("%s", s + 1);
  m = 122;
  get_sa();
  get_h();
  for (int j = 1; j <= 18; j++)
    for (int i = 1; i + (1 << j) - 1 <= n; i++)
      st[i][j] = min(st[i][j - 1], st[i + (1 << (j - 1))][j - 1]);
  while (T--) {
    int la, lb;
    scanf("%d%d", &la, &lb);
    long long ans = 0;
    int cnt = 0;
    for (int i = 1; i <= la; i++) scanf("%d", &a[i]), cc[++cnt] = a[i];
    for (int i = 1; i <= lb; i++) scanf("%d", &b[i]), cc[++cnt] = b[i];
    ans -= work(la);
    for (int i = 1; i <= lb; i++) a[i] = b[i];
    ans -= work(lb);
    for (int i = 1; i <= la + lb; i++) a[i] = cc[i];
    ans += work(la + lb);
    printf("%I64d\n", ans);
  }
  return 0;
}
