Problem:
Score : 300 points

Problem Statement

You are given a string s.
Among the different substrings of s, print the K-th lexicographically smallest one.

A substring of s is a string obtained by taking out a non-empty contiguous part in s.
For example, if s = ababc, a, bab and ababc are substrings of s, while ac, z and an empty string are not.
Also, we say that substrings are different when they are different as strings.

Let X = x_{1}x_{2}...x_{n} and Y = y_{1}y_{2}...y_{m} be two distinct strings. X is lexicographically larger than Y if and only if Y is a prefix of X or x_{j} > y_{j} where j is the smallest integer such that x_{j} \neq y_{j}.

Constraints

1 ≤ |s| ≤ 5000

s consists of lowercase English letters.

1 ≤ K ≤ 5

s has at least K different substrings.

Partial Score

200 points will be awarded as a partial score for passing the test set satisfying |s| ≤ 50.

Input

Input is given from Standard Input in the following format:

s
K

Output

Print the K-th lexicographically smallest substring of K.

Sample Input 1

aba
4

Sample Output 1

b

s has five substrings: a, b, ab, ba and aba.
Among them, we should print the fourth smallest one, b.
Note that we do not count a twice.

Sample Input 2

atcoderandatcodeer
5

Sample Output 2

andat

Sample Input 3

z
1

Sample Output 3

z

Solution in Haskell (GHC 7.10.3) (judge verdict: Time Limit Exceeded)

{-# OPTIONS_GHC -O #-}
{-# LANGUAGE OverloadedStrings #-}
{-# LANGUAGE ViewPatterns #-}

import Control.Monad
import Data.List
import qualified Data.ByteString.Char8 as B
import qualified Data.Vector as V
import qualified Data.Set as S

data Dat = Dat { str :: B.ByteString, b :: Int, e ::Int}
instance Show Dat where
    show x = B.unpack $ B.drop (b x) $ B.take (e x + 1) (str x)

instance Ord Dat where
    compare x y = compare (subs x) (subs y)
                    where subs dt = B.drop (b dt) $ B.take (e dt + 1) (str dt)

instance Eq Dat where
    x == y = (subs x) == (subs y)
                    where subs dt = B.drop (b dt) $ B.take (e dt + 1) (str dt)

-- sol :: Int -> B.ByteString -> Char -> String
sol n s c =
    if sz < n
        then sol (n-sz) s (succ c)
        else show $ S.elemAt (n-1) sets
    where
        ls = B.length s
        sz = S.size sets
        sets = V.foldl' (\set st -> S.insert st set) S.empty ss
        ss = V.concatMap ps $ V.unfoldr fi 0
        fi o
            | o >= ls  = Nothing
            | B.index s o == c = Just(o, o+1)
            | otherwise        = fi $ o+1
        ps i = V.map (\to -> Dat s i to)  $ V.enumFromN i $ ls-i

main = do
    s <- B.getLine
    n <- readLn
    putStrLn $ sol n s 'a'