import java.io.File;
import java.util.Scanner;
import java.util.Set;
import java .util.HashSet;
import java.util.Arrays;
public class SetIntersection
{
	public static String delist(Set<Integer> set)
	{
		Object[] objectArray = set.toArray();
		int[] finalarray = new int[objectArray.length];
		for (int i = 0; i < objectArray.length; i++)
		{
			finalarray[i] = Integer.parseInt(objectArray[i].toString());
		}
		Arrays.sort(finalarray);
		String newnewlst = "";
		for (int i = 0; i < finalarray.length; i++)
		{
			if (i != finalarray.length-1) newnewlst+=finalarray[i]+",";
			else newnewlst+=finalarray[i];
		}
		return newnewlst;
	}
	public static String bin(String line)
	{
		String[] lstall = line.split(";");
		String[] lst1 = lstall[0].split(",");
		String[] lst2 = lstall[1].split(",");
		String newlst = "";
		Set<Integer> set = new HashSet<Integer>();

		for (int i = lst1.length-1; i >= 0; i--)
		{
			for (int j = 0; j < lst2.length; j++)
			{
				if (Integer.parseInt(lst1[i]) == Integer.parseInt(lst2[j])) 
				{
					Integer a = new Integer(lst1[i]);
					set.add(a); 
				}
			}
		}
		return delist(set);
	}
	public static void main(String[] args)
	{
		try
		{
			File file = new File(args[0]);
			Scanner scanner = new Scanner(file);
			while(scanner.hasNextLine())
			{
				System.out.println(bin(scanner.nextLine()));
			}
		}
		catch (Exception e)
		{
			System.out.println(e);
		}
	}
}