You are given two arrays A and B, each already sorted in non-decreasing order, and a 1-indexed position k. Consider merging A and B into one non-decreasing sequence (keeping duplicates). Output the value at position k of that merged sequence — that is, the k-th smallest value of the combined multiset.

You do not need to materialize the merged array: walk both arrays with two pointers, always taking the smaller front element, and stop after k elements have been taken.

Input format

Line 1: three integers n, m, k separated by spaces — the length of A, the length of B, and the 1-indexed position. Line 2: n space-separated integers, array A in non-decreasing order (empty when n == 0). Line 3: m space-separated integers, array B in non-decreasing order (empty when m == 0).

Output format

A single integer: the k-th smallest value of the merged multiset.

Constraints

• 0 ≤ n, m ≤ 100000
• 1 ≤ k ≤ n + m (so at least one array is non-empty and k is a valid position)
• -1000000000 ≤ each value ≤ 1000000000
• Both A and B are guaranteed to be sorted in non-decreasing order.

3 3 4
1 3 5
2 4 6

4

2 0 2
7 9

9