Consider n integer numbers a₁, a₂,..., a_n. Consider the products of their m-tuples: b₁, b₂,..., b_N. You are to find k-th largest product, i.e., k-th item in the list (b_i) sorted in non-increasing order (items of the list are numbered starting from 1).

Note that the numbers can be negative.

The input file contains three integer numbers n, m, k (1 ≤ n, k ≤ 10000, 1 ≤ m ≤ 13, k ≤ C_n^m), followed by n integer numbers a_i (-10⁶ ≤ a_i ≤ 10⁶).

Output one integer number — the k-th largest product.

sample input	sample output
4 3 3 2 3 3 5	30

There are four possible products in the example: 3 · 3 · 5 = 45, 2 · 3 · 5 = 30 (involving the first 3), 2 · 3 · 5 = 30 (involving the second 3), 2 · 3 · 3 = 18.