跑了倒数rk5...
/* Think Thank Thunk */
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
typedef unsigned long long ULL;
const int maxn = 500005;
int n, m, sum[26][maxn];
char str[maxn];
ULL hash[2][maxn], power[2][maxn], seed[] = {233, 997}, mod[] = {1000000009, 1000000007};
inline int iread() {
int f = 1, x = 0; char ch = getchar();
for(; ch < '0' || ch > '9'; ch = getchar()) f = ch == '-' ? -1 : 1;
for(; ch >= '0' && ch <= '9'; ch = getchar()) x = x * 10 + ch - '0';