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.

Input

Input is given from Standard Input in the following format:


s
K


Output

Print the K-th lexicographically smallest substring of K.

Examples

Input

aba
4


Output

b


Input

atcoderandatcodeer
5


Output

andat


Input

z
1


Output

z
import java.util.*;
import java.io.*;

class Main{
    public static void main(String[] args){
        FastScanner fsc=new FastScanner();
        String s=fsc.next();
        int k=fsc.nextInt();
        fsc.close();
        int n=s.length();
        
        String[] min5=new String[5];
        StringBuilder sb=new StringBuilder();
        for(int i=0;i<n;i++) sb.append('z');
        String max=sb.toString();
        for(int i=0;i<5;i++) min5[i]=max;

        Out:for(int i=0;i<=n-1;i++){
            String f=s.substring(i, i+1);
            if(f.compareTo(min5[4])>0) continue Out;
            In:for(int i2=i+1;i2<=n;i2++){
                String str=s.substring(i, i2);
                for(int j=0;j<5;j++){
                    if(str.equals(min5[j])){
                        continue In;
                    }
                }
                if(str.compareTo(min5[0])<0){
                    min5[4]=min5[3];
                    min5[3]=min5[2];
                    min5[2]=min5[1];
                    min5[1]=min5[0];
                    min5[0]=str;
                }
                else if(str.compareTo(min5[1])<0){
                    min5[4]=min5[3];
                    min5[3]=min5[2];
                    min5[2]=min5[1];
                    min5[1]=str;
                }
                else if(str.compareTo(min5[2])<0){
                    min5[4]=min5[3];
                    min5[3]=min5[2];
                    min5[2]=str;
                }
                else if(str.compareTo(min5[3])<0){
                    min5[4]=min5[3];
                    min5[3]=str;
                }
                else if(str.compareTo(min5[4])<0){
                    min5[4]=str;
                }
                else continue Out;
            }
        }
    
        //for(int i=0;i<5;i++) System.out.println(min5[i]);
        System.out.println(min5[k-1]);
    }
    static class FastScanner {
        private final InputStream in = System.in;
        private final byte[] buffer = new byte[1024];
        private int ptr = 0;
        private int buflen = 0;
        private boolean hasNextByte(){
            if(ptr<buflen) return true;
            else{
                ptr = 0;
                try{
                    buflen = in.read(buffer);
                }
                catch(IOException e){
                    e.printStackTrace();
                }
                if(buflen<=0) return false;
            }
        return true;
        }
        private int readByte() { if (hasNextByte()) return buffer[ptr++]; else return -1;}
        private static boolean isPrintableChar(int c) { return 33 <= c && c <= 126;}
        public boolean hasNext() { while(hasNextByte() && !isPrintableChar(buffer[ptr])) ptr++; return hasNextByte();}
        public String next() {
            if (!hasNext()) throw new NoSuchElementException();
            StringBuilder sb = new StringBuilder();
            int b = readByte();
            while(isPrintableChar(b)) {
                sb.appendCodePoint(b);
                b = readByte();
            }
            return sb.toString();
        }
        public long nextLong() {
            if (!hasNext()) throw new NoSuchElementException();
            long n = 0;
            boolean minus = false;
            int b = readByte();
            if (b == '-') {
                minus = true;
                b = readByte();
            }
            if (b < '0' || '9' < b) throw new NumberFormatException();
            while(true){
                if ('0' <= b && b <= '9') {
                    n *= 10;
                    n += b - '0';
                }
                else if(b == -1 || !isPrintableChar(b)) return minus ? -n : n;
                else throw new NumberFormatException();
                b = readByte();
            }
        }
        public int nextInt() {
            long nl = nextLong();
            if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
            return (int) nl;
        }
        public double nextDouble() { return Double.parseDouble(next());}
        public void close(){
            try{in.close();}
            catch(IOException e){e.printStackTrace();}
        }
    }
}
