#include <iostream>

using namespace std;

class Solution {

public:

    void merge(int A[], int m, int B[], int n) {

        if(m<|| n<)

            return;

        if(n == )

            return ;

        if(m ==)

        {

            for(int i = ;i<n;i++)

                A[i] = B[i];

        }

        int a_pointer = m -;

        int b_pointer = n-;

        int c_pointer = m+n-;

        while(a_pointer!=- && b_pointer!= -)

        {

            while(a_pointer != - &&b_pointer!= - && A[a_pointer]>=B[b_pointer])

            {

                A[c_pointer] = A[a_pointer];

                c_pointer--;

                a_pointer--;

            }

            while(a_pointer!= - && b_pointer != - &&A[a_pointer]<B[b_pointer] )

            {

                A[c_pointer] = B[b_pointer];

                c_pointer--;

                b_pointer--;

            }

        }

        if(a_pointer == - && c_pointer!= -)

            for(int i = ;i<=c_pointer;i++)

                A[i] = B[i];

        for(int i = ;i<=m+n-;i++)

            cout<<A[i]<<endl;

    }

};

int main()

{

    Solution myS;

    int A[] = {,,,,,,};

    int B[] = {,,,,,};

    myS.merge(A,,B,);

    return ;

}