对于每一组询问,输出一行一个整数,表示该组询问的答案.由于答案可能很大,仅需要输出这个答案对于23333333333333333(一个巨大的质数)取模的余数.

#include <cstdio>
#include <cstring>
#include <algorithm>
#define N 500010
#define mod 23333333333333333ll
using namespace std;
int n , m , sa[N] , r[N] , ws[N] , wa[N] , wb[N] , wv[N] , rank[N] , height[N][21] , log[N] , num[N * 6] , vis[N] , pos[N] , val[N] , sta[N] , top , lp[N] , rp[N];
char str[N];
void da()
{int i , j , p , *x = wa , *y = wb;for(i = 0 ; i < m ; i ++ ) ws[i] = 0;for(i = 0 ; i < n ; i ++ ) ws[x[i] = r[i]] ++ ;for(i = 1 ; i < m ; i ++ ) ws[i] += ws[i - 1];for(i = n - 1 ; i >= 0 ; i -- ) sa[--ws[x[i]]] = i;for(p = j = 1 ; p < n ; j <<= 1 , m = p){for(p = 0 , i = n - j ; i < n ; i ++ ) y[p ++ ] = i;for(i = 0 ; i < n ; i ++ ) if(sa[i] - j >= 0) y[p ++ ] = sa[i] - j;for(i = 0 ; i < n ; i ++ ) wv[i] = x[y[i]];for(i = 0 ; i < m ; i ++ ) ws[i] = 0;for(i = 0 ; i < n ; i ++ ) ws[wv[i]] ++ ;for(i = 1 ; i < m ; i ++ ) ws[i] += ws[i - 1];for(i = n - 1 ; i >= 0 ; i -- ) sa[--ws[wv[i]]] = y[i];for(swap(x , y) , x[sa[0]] = 0 , p = i = 1 ; i < n ; i ++ ){if(y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + j] == y[sa[i] + j]) x[sa[i]] = p - 1;else x[sa[i]] = p ++ ;}}for(i = 1 ; i < n ; i ++ ) rank[sa[i]] = i;for(p = i = 0 ; i < n - 1 ; height[rank[i ++ ]][0] = p)for(p ? p -- : 0 , j = sa[rank[i] - 1] ; r[i + p] == r[j + p] ; p ++ );
}
int query(int x , int y)
{x ++ ;int k = log[y - x + 1];return min(height[x + (1 << k) - 1][k] , height[y][k]);
}
bool cmp(int a , int b)
{return rank[a] < rank[b];
}
int main()
{int i , j , k , cnt , tot;long long ans;scanf("%d%d%s" , &n , &k , str);for(i = 0 ; i < n ; i ++ ) r[i] = str[i] - 'a' + 1;n ++ , m = 28 , da() , n -- ;for(i = 2 ; i <= n ; i ++ ) log[i] = log[i >> 1] + 1;for(i = 1 ; i <= log[n] ; i ++ )for(j = (1 << i) ; j <= n ; j ++ )height[j][i] = min(height[j][i - 1] , height[j - (1 << (i - 1))][i - 1]);while(k -- ){scanf("%d" , &cnt);tot = 0 , ans = 0;for(i = 1 ; i <= cnt ; i ++ ){scanf("%d" , &num[i]) , num[i] -- ;if(!vis[num[i]]) vis[num[i]] = 1 , pos[++tot] = num[i];}sort(pos + 1 , pos + tot + 1 , cmp);for(i = 1 ; i < tot ; i ++ )val[i] = query(rank[pos[i]] , rank[pos[i + 1]]);sta[0] = top = 0;for(i = 1 ; i < tot ; i ++ ){while(top && val[sta[top]] > val[i]) top -- ;lp[i] = i - sta[top] , sta[++top] = i;}sta[0] = tot , top = 0;for(i = tot - 1 ; i  ; i -- ){while(top && val[sta[top]] >= val[i]) top -- ;rp[i] = sta[top] - i , sta[++top] = i;}for(i = 1 ; i < tot ; i ++ ) ans = (ans + (long long)lp[i] * rp[i] * val[i]) % mod;printf("%lld\n" , ans);for(i = 1 ; i <= cnt ; i ++ ) vis[num[i]] = 0;}return 0;
}