#include <bits/stdc++.h>
using namespace std;
char s[200010];
int sa[200010], rk[200010], height[200010], h[200010];
int t1[200010], t2[200010], c[200010];
int rmq[200010][19], tat[200010];
int n, m;
void build(int m) {
  int *x = t1, *y = t2;
  for (int i = 1; i <= m; i++) c[i] = 0;
  for (int i = 1; i <= n; i++) c[x[i] = s[i]]++;
  for (int i = 1; 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 p = 0;
    for (int i = n - k + 1; i <= n; i++) y[++p] = i;
    for (int i = 1; i <= n; i++)
      if (sa[i] > k) y[++p] = 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 = 1; i <= m; i++) c[i] += c[i - 1];
    for (int i = n; i >= 1; i--) sa[c[x[y[i]]]--] = y[i];
    swap(x, y), p = 1, x[sa[1]] = 1;
    for (int i = 2; i <= n; i++)
      x[sa[i]] = (y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k])
                     ? p
                     : ++p;
    if (p >= n) break;
    m = p;
  }
}
int query(int l, int r) {
  return min(rmq[l][tat[r - l + 1]],
             rmq[r - (1 << tat[r - l + 1]) + 1][tat[r - l + 1]]);
}
int lcp(int x, int y) {
  if (x == y) return n - x + 1;
  if (rk[x] > rk[y]) swap(x, y);
  return query(rk[x] + 1, rk[y]);
}
bool comp(const pair<int, int> &a, const pair<int, int> &b) {
  if (a.first != b.first) return rk[a.first] < rk[b.first];
  return a.second < b.second;
}
int main() {
  scanf("%d%d", &n, &m);
  scanf("%s", s + 1);
  build(2333);
  for (int i = 1; i <= n; i++) rk[sa[i]] = i;
  for (int i = 1; i <= n; i++) {
    h[i] = h[i - 1] - (h[i - 1] > 0);
    while (h[i] <= n && s[i + h[i]] == s[sa[rk[i] - 1] + h[i]]) h[i]++;
    height[rk[i]] = h[i];
  }
  for (int i = 1; i <= n; i++) rmq[i][0] = height[i];
  for (int i = 3; i <= n; i++) tat[i] = tat[(i + 1) / 2] + 1;
  for (int j = 1; j <= 18; j++)
    for (int i = 1; i + (1 << j) - 1 <= n; i++)
      rmq[i][j] = min(rmq[i][j - 1], rmq[i + (1 << (j - 1))][j - 1]);
  for (int x, y, i = 1; i <= m; i++) {
    vector<pair<int, int>> a;
    scanf("%d%d", &x, &y);
    for (int b, j = 1; j <= x; j++) scanf("%d", &b), a.emplace_back(b, 1);
    for (int b, j = 1; j <= y; j++) scanf("%d", &b), a.emplace_back(b, 0);
    sort(a.begin(), a.end(), comp);
    int sz = a.size();
    long long ans = 0;
    for (int sb = 0; sb <= 1; sb++) {
      long long sum = 0;
      map<int, int> cnt;
      for (int i = 0; i < sz; i++) {
        if (a[i].second == 0)
          ans += sum;
        else
          cnt[n - a[i].first + 1]++, sum += n - a[i].first + 1;
        if (i + 1 < sz) {
          int len = lcp(a[i].first, a[i + 1].first);
          while (!cnt.empty()) {
            map<int, int>::iterator t = --cnt.end();
            if (t->first <= len) break;
            sum -= t->first * (long long)t->second;
            cnt[len] += t->second;
            sum += len * (long long)t->second;
            cnt.erase(t);
          }
        }
      }
      reverse(a.begin(), a.end());
    }
    cout << ans << endl;
  }
  return 0;
}
