#include <bits/stdc++.h>
using namespace std;
const int mod = 1e9 + 7;
const int N = 200010;
char s[N];
int n, q, dp[N][20];
struct node {
  int lcp, id, t;
} stk[N];
std::vector<pair<int, int> > v;
struct Suffix_Array {
  int sa[N], Rank[N], h[N], n;
  int xx[N], yy[N], c[N];
  char *s;
  bool cmp(int *s, int x, int y, int k) {
    return (s[x] == s[y]) && (s[x + k] == s[y + k]);
  }
  void ins(char *str) {
    s = str;
    n = strlen(s) + 1;
  }
  void DA() {
    memset(c, 0, sizeof(c));
    int *x = xx, *y = yy, m = 130, *t, i;
    for (i = 0; i < n; i++) x[i] = s[i];
    for (i = 0; i < n; i++) c[x[i]]++;
    for (i = 1; i < m; i++) c[i] += c[i - 1];
    for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;
    for (int k = 1, tot = 0; tot < n; k <<= 1, m = tot) {
      memset(c, 0, sizeof(c));
      for (i = 0; i < n; i++) c[x[i]]++;
      for (i = 1; i < m; i++) c[i] += c[i - 1];
      for (i = n - k, tot = 0; i < n; i++) y[tot++] = i;
      for (i = 0; i < n; i++)
        if (sa[i] >= k) y[tot++] = sa[i] - k;
      for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
      for (i = tot = 1, t = x, x = y, y = t, x[sa[0]] = 0; i < n; i++)
        x[sa[i]] = cmp(y, sa[i - 1], sa[i], k) ? tot - 1 : tot++;
    }
  }
  void cal_height() {
    int i, j, k = 0;
    for (i = 1; i < n; i++) Rank[sa[i]] = i;
    for (i = 0; i < n - 1; h[Rank[i++]] = k)
      for (k ? k-- : 0, j = sa[Rank[i] - 1]; s[i + k] == s[j + k]; k++)
        ;
    int m = floor(log(n + 0.0) / log(2.0));
    for (int i = 1; i <= n; i++) dp[i][0] = h[i];
    for (int i = 1; i <= m; i++)
      for (int j = n; j; j--) {
        dp[j][i] = dp[j][i - 1];
        if (j + (1 << (i - 1)) <= n)
          dp[j][i] = min(dp[j][i], dp[j + (1 << (i - 1))][i - 1]);
      }
  }
} SA;
inline int lcp(int l, int r) {
  int m = 31 - __builtin_clz(r - l + 1);
  return min(dp[l][m], dp[r - (1 << m) + 1][m]);
}
inline bool cmp(pair<int, int> a, pair<int, int> b) {
  return a.first == b.first ? a.second > b.second : a.first < b.first;
}
unordered_map<int, bool> mp;
int main(int argc, char const *argv[]) {
  scanf("%d%d", &n, &q);
  scanf("%s", s);
  SA.ins(s);
  SA.DA();
  SA.cal_height();
  while (q--) {
    long long ans = 0;
    v.clear();
    mp.clear();
    int k, l;
    scanf("%d%d", &k, &l);
    for (int i = 1; i <= k; i++) {
      int x;
      scanf("%d", &x);
      mp[x] = 1;
      x--;
      v.push_back({SA.Rank[x] + 1, 1});
    }
    for (int i = 1; i <= l; i++) {
      int x;
      scanf("%d", &x);
      if (mp.count(x)) ans += n - x + 1;
      x--;
      v.push_back({SA.Rank[x] + 1, 0});
    }
    sort(v.begin(), v.end());
    for (int t = 0; t < 2; t++) {
      long long res = 0;
      int top = 0;
      for (auto i : v) {
        int x = i.first, y = i.second;
        node now = {SA.h[x], x, y ^ t};
        if (!(y ^ t)) {
          if (!top || x == stk[top].id) continue;
          if (x - 1 >= stk[top].id + 1) {
            int LCP = lcp(stk[top].id + 1, x - 1), cnt = 0;
            while (top && LCP <= stk[top].lcp) {
              res -= (long long)stk[top].t * (stk[top].lcp - LCP);
              cnt += stk[top--].t;
            }
            if (cnt && LCP) stk[++top] = {LCP, x - 1, cnt};
          }
          ans += res;
        } else {
          int LCP = now.lcp, cnt = 0;
          if (top)
            if (stk[top].id + 1 <= x) LCP = min(LCP, lcp(stk[top].id + 1, x));
          res += now.lcp;
          while (top && LCP <= stk[top].lcp) {
            res -= (long long)stk[top].t * (stk[top].lcp - LCP);
            cnt += stk[top--].t;
          }
          if (cnt && LCP) stk[++top] = {LCP, x, cnt};
          stk[++top] = now;
        }
      }
      if (!t) sort(v.begin(), v.end(), cmp);
    }
    printf("%lld\n", ans);
  }
  return 0;
}
