A build pairs exactly one part from list A with exactly one part from list B; the pair cost is the sum of the two prices. Both lists are sorted in non-decreasing order. Considering all len(A) * len(B) possible pairs (counting multiplicity), print the k-th smallest pair cost.
Input format
Line 1: three integers n, m, and k — the length of A, the length of B, and the rank.
Line 2: n non-decreasing integers, list A.
Line 3: m non-decreasing integers, list .
Output format
A single integer: the k-th smallest pair cost.
Constraints
- 1 <= n, m <= 2000
- 1 <= k <= n * m
- -1000000000 <= each price <= 1000000000