PROGRAMMING:Sort Numbers

Given two sequences A=($$a_{ 1}$$,$$a_{ 2}$$,$$a_{ 3}$$,…,$$a_{ n}$$) and B=($$b_{ 1}$$,$$b_{ 2}$$,$$b_{ 3}$$,…,$$b_{ m}$$), multiply $$a_{ i}$$ by $$b_{ j}$$, 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:
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:
Output the answer on a single line for each test case.
### Sample Input:
```in
1 3 3
one
3 2 1
3 3 7
1 2 3
1 2 3
```
### Sample Output:
```out
three
six
```







answer：If there is no answer, please comment