Two price lists are given: list A with p values and list B with q values. Consider every possible pair sum a_i + b_j (there are p * q of them, counting repeated values as separate pairs). Report the k-th smallest of these sums, where the smallest sum is the 1st.
Input format
Line 1: three integers p, q, and k.
Line 2: p space-separated integers, list A.
Line 3: q space-separated integers, list B.
Output format
A single integer: the k-th smallest pair sum.
Constraints
- 1 ≤ p, q ≤ 300
- 1 ≤ k ≤ p * q
- -1000000000 ≤ each value ≤ 1000000000