// Program 58: Sort Two Arrays Using Insertion Sort

import java.util.*;
class SortTwoArrays
{
    static void sort(int[] a)
    {
        for (int i = 1; i < a.length; i++)
        {
            int key = a[i], j = i - 1;
            while (j >= 0 && a[j] > key)
            {
                a[j + 1] = a[j];
                j--;
            }
            a[j + 1] = key;
        }
    }
    static void display(int[] a)
    {
        for (int i = 0; i < a.length; i++)
        {
            System.out.print(a[i] + " ");
        }
        System.out.println();
    }
    public static void main(String[] args)
    {
        Scanner sc = new Scanner(System.in);
        System.out.print("Size of first array: ");
        int n = sc.nextInt();
        int[] a = new int[n];
        for (int i = 0; i < n; i++)
        {
            a[i] = sc.nextInt();
        }
        System.out.print("Size of second array: ");
        int m = sc.nextInt();
        int[] b = new int[m];
        for (int i = 0; i < m; i++)
        {
            b[i] = sc.nextInt();
        }
        sort(a);
        sort(b);
        System.out.print("First sorted array: ");
        display(a);
        System.out.print("Second sorted array: ");
        display(b);
    }
}