You are given two sentences, each a sequence of lowercase words separated by single spaces. Consider all words from both sentences together. A word is uncommon if it appears exactly once in this combined collection (so it is in one sentence, once, and nowhere else).
Print all uncommon words in ascending lexicographic order. If there are none, print an empty line.
Input format
Line 1: the first sentence (space-separated lowercase words). Line 2: the second sentence (space-separated lowercase words).
Output format
One line: the uncommon words in ascending lexicographic order, space-separated. If there are none, print an empty line.
Constraints
- Each sentence has between 1 and 2000 words.
- Each word has length between 1 and 20 and contains only
a-z.