Problem: A student, Kita_masa, is taking an English examination. In this examination, he has to write a sentence of length m.

Since he completely forgot the English grammar, he decided to consider all sentences of length m constructed by concatenating the words he knows and write the K-th sentence among the candidates sorted in lexicographic order. He believes that it must be the correct sentence because K is today's lucky number for him.

Each word may be used multiple times (or it's also fine not to use it at all) and the sentence does not contain any extra character between words. Two sentences are considered different if the order of the words are different even if the concatenation resulted in the same string.



Input

The first line contains three integers n (1 \leq n \leq 100), m (1 \leq m \leq 2000) and K (1 \leq K \leq 10^{18}), separated by a single space. Each of the following n lines contains a word that Kita_masa knows. The length of each word is between 1 and 200, inclusive, and the words contain only lowercase letters. You may assume all the words given are distinct.

Output

Print the K-th (1-based) sentence of length m in lexicographic order. If there is no such a sentence, print "-".

Examples

Input

2 10 2
hello
world


Output

helloworld


Input

3 3 6
a
aa
b


Output

aba


Input

2 59 1000000000000000000
a
b


Output

-

Solution (in JAVA):

Solution:
import java.io.IOException;
import java.util.Arrays;
import java.util.Scanner;

class Main {
	public static void main(String[] args) throws IOException {
		new Main().run();
	}

	long INF = (long) (1e19);

	void run() {
		Scanner sc = new Scanner(System.in);
		int n = sc.nextInt();
		int m = sc.nextInt();
		long k = sc.nextLong();
		INF = k + 1;
		long[] f = new long[m + 1];
		f[0] = 1;
		char[][] s = new char[n][];
		for (int i = 0; i < n; ++i) {
			s[i] = sc.next().toCharArray();
		}
		for (int j = 0; j < m; ++j) {
			for (int i = 0; i < n; ++i) {
				if (j + s[i].length > m)
					continue;
				f[j + s[i].length] = add(f[j + s[i].length], f[j]);
			}
		}
		if (f[m] < k) {
			System.out.println("-");
			return;
		}
		StringBuilder ans = new StringBuilder();
		long[] g = new long[m + 1];
		g[0] = 1;
		boolean[][] h = new boolean[n][];
		for (int i = 0; i < n; ++i) {
			h[i] = new boolean[s[i].length + 1];
			if (s[i].length <= m) {
				h[i][0] = true;
			}
		}
		for (int T = 0; T < m; ++T) {
			char c = '*';
			long sum = 0;
			boolean flag = false;
			for (int i = 0; i < 26; ++i) {
				c = (char) ('a' + i);
				long tmp = 0;
				for (int u = 0; u < n; ++u) {
					for (int v = 1; v <= Math.min(s[u].length, T + 1); ++v) {
						if (h[u][v - 1] && s[u][v - 1] == c) {
							tmp = add(tmp, mul(g[T + 1 - v], f[m - (T + 1) - (s[u].length - v)]));
						}
					}
				}
				if (add(tmp, sum) >= k) {
					k -= sum;
					flag = true;
					break;
				}
				sum = add(sum, tmp);
			}
			if (!flag)
				throw new AssertionError();
			ans.append(c);
			if (k == 0)
				break;
			for (int i = 0; i < n; ++i) {
				for (int j = h[i].length - 1; j >= 1; --j) {
					h[i][j] = s[i][j - 1] == c && h[i][j - 1];
				}
			}
			for (int i = 0; i < n; ++i) {
				h[i][0] = T + s[i].length + 1 <= m;
			}
			for (int i = 0; i < n; ++i) {
				if (h[i][s[i].length]) {
					g[T + 1] = add(g[T + 1], g[T + 1 - s[i].length]);
				}
			}
		}
		System.out.println(ans);
	}

	long add(long a, long b) {
		if (a + b < 0 || a + b >= INF) {
			return INF;
		} else {
			return a + b;
		}
	}

	long mul(long a, long b) {
		if (a * b < 0 || a * b >= INF) {
			return INF;
		} else {
			return a * b;
		}
	}


	void tr(Object... objects) {
		System.out.println(Arrays.deepToString(objects));
	}
}