import java.util.Scanner;
public class Union_Intersection_Of_Two_SortedArray {

	public static void Union(int[] a,int[] b,int m, int n)
	{
		int i=0;
		int j=0;
		int k=0;
		int x= m+n;
		int[] U= new int[x];
		while(i<n && j<m)
		{
			if(a[i]<b[j])

				System.out.print(a[i++]+"");

			else if (b[j]<a[i])
				System.out.print(b[j++]+"");
			else
			{
				System.out.print(b[j++]+"");
				i++;
		}}
		while(i < n)
			System.out.print(a[i++]+"");
		while(j < m)
			System.out.print(b[j++]+"");

			}

	public static void Intersection(int[] a,int[] b,int m, int n)
	{System.out.print("\nintersection is");
		int i=0;
		int j=0;
		while(i < n && j < m)
		{
			if(a[i]<b[j])
				i++;
			else if(a[i] > b[j])
				j++;

			else
			{
				System.out.print(b[j++]+" ");
				i++;
			}
		}
	}
	public static void main(String[] rahul)
	{
		int[] a= {3,6,9,11};
		int n= a.length;
		int[] b= {1,3,5,8};
		int m=b.length;
		Union(a,b,n,m);
		Intersection(a,b,n,m);
	}
}