import java.util.*;

class HW4Lists {

    public static List<Integer> union(List<Integer> lst1, List<Integer> lst2) 
    {
	// Should return the union of the two sorted lists, with no duplicates 
    
    }

    public static List<Integer> intersect(List<Integer> lst1, List<Integer> lst2)
    {
        // Should return the intersection of the two sorted lists, with no duplicates
    }

    public static void main( String [] args) {

        int j;
	ArrayList<Integer> firstList = new ArrayList<Integer>();

        for (int i = 0; i < 20; i++) {

	    j = (int) (100 * Math.random());
            if (j < 50) {
		firstList.add(i);
	    }
        }

        System.out.println(firstList);

        ArrayList<Integer> secondList = new ArrayList<Integer>();

        for (int i = 0; i < 20; i++) {

	    j = (int) (100 * Math.random());
            if (j < 50) {
		secondList.add(i);
	    }
        }

        System.out.println(secondList);

        List<Integer> mergedList = union(firstList,secondList);
        System.out.println(mergedList);

        List<Integer> commonList = intersect(firstList, secondList);
        System.out.println(commonList);
    }
}