Create Largest Number of Kth Length

You are given two integer arrays, 'nums1' of length 'm' and 'nums2' of length 'n', which represent the digits of two numbers. You are also given an integer 'k'.

Your task is to create the lexicographically largest possible number of length 'k' by picking digits from the two given arrays. The relative order of digits taken from the same array must be preserved.

Return an array of 'k' digits that represents the answer.

Input Format:

The first line contains three space-separated integers: 'm' (length of nums1), 'n' (length of nums2), and 'k'.

The second line contains 'm' space-separated integers, representing the elements of array 'nums1'.

The third line contains 'n' space-separated integers, representing the elements of array 'nums2'.

Output Format:

Print 'k' space-separated integers representing the digits of the maximum number.

Note:

Lexicographically larger means that at the first position where two numbers differ, the number with the larger digit is considered greater. For example, [9, 8, 5] is lexicographically larger than [9, 7, 6].

The relative order of digits from the same source array must be maintained. For example, if you take 4 and 5 from [3, 4, 6, 5], they must appear in the order 4, 5 in the result.