The following languages are only available languages for the problems from the contest
Surprise Language Round #8:
→ Virtual participation
Virtual contest is a way to take part in past contest, as close as possible to participation on time. It is supported only ICPC mode for virtual contests.
If you've seen these problems, a virtual contest is not for you - solve these problems in the archive.
If you just want to solve some problem from a contest, a virtual contest is not for you - solve this problem in the archive.
Never use someone else's code, read the tutorials or communicate with other person during a virtual contest.
You are given two sets of numbers. Your task is to print all numbers from the sets, that both sets don't contain simultaneously.
The first line contains the description of the first set, the second line contains the description of the second set. Each description begins with the number of elements in this set. All elements of the set follow in the arbitrary order. In each set all elements are distinct and both sets are not empty. The number of elements in each set doesn't exceed 1000. All elements of the sets are integers from -1000 to 1000.
Print the number of the required numbers and then the numbers themselves separated by a space.
3 1 2 3 3 2 3 4
2 1 4
5 1 4 8 9 10 4 1 2 8 10
3 2 4 9
Codeforces (c) Copyright 2010-2020 Mike Mirzayanov