Problem C
Keyboardd
This could not have happened at a more inconvenient time; it is the start of the contest and she was just about to type in the solution to the first problem! Joanna does not have time to remove and clean every key on her keyboard, so she wonders if there is a way to quickly identify the sticky keys. Starting to panic, she quickly types some text on her keyboard and stares at the resulting text displayed on her screen.
Given the line of text that Joanna typed on her keyboard and the resulting text displayed on her screen, help her determine which keys must be sticky.
Input
The input consists of:
-
One line containing a string $s$ ($1 \leq \mathrm{length}(s) \leq 1\, 000$), the text that Joanna typed on her keyboard.
-
One line containing a string $t$ ($1 \leq \mathrm{length}(t) \leq 1\, 000$), the text displayed on Joanna’s screen as a result.
Both $s$ and $t$ consist only of lower-case letters (‘a’–‘z’) and spaces (‘ ’), and start and end with a letter.
It is guaranteed that $t$ is the result of doubling each character in $s$ that corresponds to a sticky key. At least one character in $s$ corresponds to a sticky key (i.e. $s \neq t$).
Output
Output all characters (letters and space) corresponding to keys that must be sticky, in any order.
| Sample Input 1 | Sample Output 1 |
|---|---|
this is very annoying thiss iss veery annoying |
se |
| Sample Input 2 | Sample Output 2 |
|---|---|
so sticky ssoo ssttiicckkyy |
its yock |
