#include <iostream>
#include <cstdio>
#include <cstring>
#define maxn 222222
using namespace std;int next[maxn][26],pre[maxn],step[maxn],f[maxn];
char s[maxn];
int N,last,n,k;
int p,q,np,nq;void insert(int x,int m)
{p=last,np=++N,step[np]=m;while (p!=-1 && next[p][x]==0) next[p][x]=np,p=pre[p];last=np;if (p==-1) return;q=next[p][x];if (step[q]==step[p]+1) { pre[np]=q; return; }nq=++N,step[nq]=step[p]+1,pre[nq]=pre[q];for (int i=0; i<26; i++) next[nq][i]=next[q][i];pre[np]=pre[q]=nq;for (;p!=-1 &&  next[p][x]==q; p=pre[p]) next[p][x]=nq;
}int get(int x)
{if (f[x]!=0) return f[x];f[x]=1;for (int i=0; i<26; i++) if (next[x][i]) f[x]+=get(next[x][i]);return f[x];
}void output(int pos,int num,int L)
{num--;if (num==0){s[L]='\0';printf("%s\n",s+1);return;}for (int i=0; i<26; i++){if (next[pos][i]==0) continue;if (f[next[pos][i]]<num) num-=f[next[pos][i]];else {s[L]='a'+i;output(next[pos][i],num,L+1);return;}}
}int main()
{pre[0]=-1;scanf("%s",s);for (int i=0; s[i]; i++) insert(s[i]-'a',i+1);f[0]=get(0);scanf("%d",&n);while (n--){scanf("%d",&k);output(0,k+1,1);}return 0;
}