22151_SortNumbers

Given two sequences A = ( a₁, a₂, a3, ..., a_n ) and B = ( b₁, b₂, b₃, ..., b_m ), multiply a_i ( 1 ≤ i ≤ n ) by b_j ( 1 ≤ j ≤ m ), a new sequence with m×n numbers is generated. Sort this sequence in non-descending order and find the number which is in the k-th position.

Input contains multiple test cases.

The first line of each test case contains three integers: n ( 1 ≤ n ≤ 10000 ), m ( 1 ≤ m ≤ 10000 ), k ( 1 ≤ k ≤ m×n ).

The second line contains n integers, representing the sequence A.

The third line contains m integers, representing the sequence B.

All the numbers of sequence A and B are in range [0, 10000].

There is a blank line after each test case.

Output the answer on a single line for each test case.

1 3 3
1
3 2 1

3 3 7
1 2 3
1 2 3

3
6