SUBLEX  Lexicographical Substring Search
Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his skills so he gave him a string S and asked him Q questions of the form:
If all distinct substrings of string S were sorted lexicographically, which one will be the Kth smallest?
After knowing the huge number of questions Kinan will ask, Daniel figured out that he can't do this alone. Daniel, of course, knows your exceptional programming skills, so he asked you to write him a program which given S will answer Kinan's questions.
Example:
S = "aaa" (without quotes)
substrings of S are "a", "a", "a", "aa", "aa", "aaa". The sorted list of distinct substrings will be: "a", "aa", "aaa".
Input
In the first line there is Kinan's string S (with length no more than 90000 characters). It contains only small letters of English alphabet. The second line contains a single integer Q (Q <= 500), the number of questions Daniel will be asked. In the next Q lines a single integer K is given (0 < K < 2^31).
Output
Output consists of Q lines, the ith contains a string which is the answer to the ith asked question.
Example
Input:
aaa
2
2
3
Output: aa
aaa
Edited: Some input file contains garbage at the end. Do not process them.
hide comments
sdfzyhx:
20170330 12:25:33
SA can be O(nlogn+qlogq) 

cydiater:
20170120 14:09:09
SAM is best 

Chowdhury Osman:
20161216 23:20:27
Suffice array with O(n * (logn)^2) is enough. 

kiwi1995:
20161216 12:13:56
suffix tree:D 

flaze:
20160801 17:42:57
well...I got WA for lots of times when supposing there is possibility that the K would be larger than the#(distinct substrings)...But I got AC supposing it doesn't exist.....It is strange... 

sxie12:
20160323 21:23:21
Suffix array nlog^2n with optimization, LCP, and binary search passed. 

lakshay_v06:
20160205 18:03:39
Loved this one! Suffix Array + LCP + Binary Search. O(nlogn + logq). 

Marcelo Fornet:
20151003 00:15:27
I got AC supposing that K <= #(distinct substrings), but I think this should explicit in the statement. 

mickey:
20150830 11:38:56
Do not deal with multicases!!! 

arunpatala:
20150731 18:19:05
@sanzee use O(nlogn) for building suffix array 
Added by:  Damir Ferizovic 
Date:  20100902 
Time limit:  1s 
Source limit:  50000B 
Memory limit:  1536MB 
Cluster:  Cube (Intel G860) 
Languages:  All except: NODEJS OBJC VB.NET 
Resource:  Own Problem 