Three friends spent their summer watching movies. For each friend, we know the sequence of movies they watched, including any repeats if they particularly enjoyed a film. Since they love watching movies together, they aimed to watch as many movies as possible as a group. Your task is to determine how many times they all watched a movie together.
The first line of the input contains three integers: , , and , representing the number of movies each friend watched (1 \leq N, M, K \leq 300). The following three lines provide the list of movie numbers each friend watched. The movies are numbered from to 10^9, reflecting their ambitious movie-watching plans.
On the first line, output a single integer indicating the maximum number of movies they watched together. On the second line, list the movie numbers they all watched, separated by spaces.
Example 1