<p>You are given two integer arrays <code>nums1</code> and <code>nums2</code> of lengths <code>m</code> and <code>n</code> respectively. <code>nums1</code> and <code>nums2</code> represent the digits of two numbers. You are also given an integer <code>k</code>.</p>

<p>Create the maximum number of length <code>k &lt;= m + n</code> from digits of the two numbers. The relative order of the digits from the same array must be preserved.</p>

<p>Return an array of the <code>k</code> digits representing the answer.</p>

<p>&nbsp;</p>
<p><strong class="example">Example 1:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,4,6,5], nums2 = [9,1,2,5,8,3], k = 5
<strong>Output:</strong> [9,8,6,5,3]
</pre>

<p><strong class="example">Example 2:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [6,7], nums2 = [6,0,4], k = 5
<strong>Output:</strong> [6,7,6,0,4]
</pre>

<p><strong class="example">Example 3:</strong></p>

<pre>
<strong>Input:</strong> nums1 = [3,9], nums2 = [8,9], k = 3
<strong>Output:</strong> [9,8,9]
</pre>

<p>&nbsp;</p>
<p><strong>Constraints:</strong></p>

<ul>
	<li><code>m == nums1.length</code></li>
	<li><code>n == nums2.length</code></li>
	<li><code>1 &lt;= m, n &lt;= 500</code></li>
	<li><code>0 &lt;= nums1[i], nums2[i] &lt;= 9</code></li>
	<li><code>1 &lt;= k &lt;= m + n</code></li>
</ul>

class Solution:
    def maxNumber(self, nums1: List[int], nums2: List[int], k: int) -> List[int]:
        

        def subFinder(nums,size):
            sequence = []
            for i in range(len(nums)):
                while sequence and sequence[-1] < nums[i] and (len(nums) - i)  > (size - len(sequence)):
                    sequence.pop()

                if size - len(sequence) > 0 :
                    sequence.append(nums[i])
            return sequence
        sequencesOne = []
        sequencesTwo = []
        for i in range(k+1):
            sequencesOne.append(subFinder(nums1,i))
            sequencesTwo.append(subFinder(nums2,k-i))
        merge = []
        for i in range(k+1):
            first = 0
            second = 0
            arr1 = sequencesOne[i]
            arr2 = sequencesTwo[i]
            currSeq = []
            while first+second < k:
                if first >= len(arr1):
                    currSeq += arr2[second:]
                    second = k
                if second >= len(arr2):
                    currSeq +=arr1[first:]
                    first = k
                else:
                    if arr1[first:] < arr2[second:]:
                        currSeq.append(arr2[second])
                        second+=1
                    else:
                        currSeq.append(arr1[first])
                        first+=1
            merge.append(currSeq)

        biggestVal = "0"
        greatestSeq = [] 
        for seq in merge:
            stringSeq = [str(i) for i in seq]
            val = "".join(stringSeq)
            if int(val) > int(biggestVal):
                biggestVal = val
                greatestSeq = seq
        return greatestSeq
29400