[ZROI620]
- n,Q<=5000
- 打死我也不写后缀数组
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define ll long long
using namespace std;
const int N=2e4;
int tr[N][30],pre[N],bin[N],A[N],v[N],maxn[N],last,flag,len,n,q,size[N],endpos[N],c[N];
ll k,str[N];
string s;
inline int read(){
int num=0;char ch=getchar();
while(!isdigit(ch))ch=getchar();
while(isdigit(ch))num=num*10+ch-'0',ch=getchar();
return num;
}
int work(int x,int len){
int num=endpos[x];
if(1LL*num*len>=k) return c[(k-1)%len+1];
k-=1LL*num*len;
rep(i,0,25)if(tr[x][i]){
int y=tr[x][i];
if(k>str[y]+1LL*size[y]*(len+1)){k-=str[y]+1LL*size[y]*(len+1);continue;}
c[len+1]=i;
return work(tr[x][i],len+1);
}
}
void insert(int c){
int p=last,x=++n,q; last=n,maxn[x]=maxn[p]+1,endpos[x]=1;
while(p&&!tr[p][c])tr[p][c]=x,p=pre[p];
if(!p){pre[x]=1;return;}
if(maxn[q=tr[p][c]]==maxn[p]+1)pre[x]=q;
else{
int y=++n; maxn[y]=maxn[p]+1;
memcpy(tr[y],tr[q],sizeof(tr[q]));
pre[y]=pre[q],pre[q]=pre[x]=y;
while(tr[p][c]==q)tr[p][c]=y,p=pre[p];
}
}
int main()
{
//freopen("a.in","r",stdin);
cin>>s; len=s.size(); n=last=1;
rep(i,0,len-1)insert(s[i]-'a');
rep(i,1,n)bin[maxn[i]]++;
rep(i,1,n)bin[i]+=bin[i-1];
rep(i,1,n)A[bin[maxn[i]]--]=i;
per(i,n,1)endpos[pre[A[i]]]+=endpos[A[i]];
rep(i,1,n)size[i]=endpos[i];
size[1]=endpos[1]=0;
per(i,n,1){
int x=A[i];
rep(c,0,25)if(tr[x][c]){
int y=tr[x][c];
size[x]+=size[y];
str[x]+=str[y]+size[y];
}
}
q=read();
while(q--){
flag=0;
scanf("%lld",&k);
putchar(work(1,0)+'a');
}
return 0;
}