def mergeSort(A,p,r):
    if p < r:
        q = int((p + r) / 2)
        mergeSort(A,p,q)
        mergeSort(A,q+1,r)
        merge(A,p,q,r)


def merge(A,p,q,r):
    n1 = int(q - p + 1)
    n2 = int(r - q)


    L = [0 for x in range(n1)]
    R = [0 for x in range(n2)]

    for i in range (0,n1):
        L[i] = A[p + i]

    for j in range (0, n2):
        R[j] = A[q + 1 + j]



    i = 0
    j = 0


    for k in range (p,r):
        if L[i] <= R[j]:
            A[k] = L[i]
            i = i + 1


        else:
            A[k] = R[j]
            j = j + 1

    print (A)



sys.setrecursionlimit(10000)
merge(A,0,3,7)