class Solution:
    """
    @param: A: sorted integer array A
    @param: B: sorted integer array B
    @return: A new sorted integer array
    """
    def mergeSortedArray(self, A, B):
        i = 0
        j = 0
        k = 0
        n = len(A)
        m = len(B)
        o = n + m
        C = []
        while k < o:
            if i < n and j < m:
                if A[i] < B[j]:
                    C.append(A[i])
                    i += 1
                else:
                    C.append(B[j])
                    j += 1
            elif i < n:
                C.append(A[i])
                i += 1
            elif j < m:
                C.append(B[j])
                j += 1
            k += 1
        return C