CF994A.Fingerprints

You are locked in a room with a door that has a keypad with 10 keys corresponding to digits from 0 to 9. To escape from the room, you need to enter a correct code. You also have a sequence of digits.

Some keys on the keypad have fingerprints. You believe the correct code is the longest not necessarily contiguous subsequence of the sequence you have that only contains digits with fingerprints on the corresponding keys. Find such code.

你被困在一个房间里，房门上有一个带有 10 个按键的数字键盘，按键分别对应数字 0 到 9。要逃出房间，你需要输入正确的密码。此外，你还拥有一串数字序列。

键盘上的某些按键留有指纹。你认为正确的密码是：你所拥有的数字序列中，最长的（不必连续的）子序列，且该子序列中只包含那些在键盘上对应按键留有指纹的数字。请找出这样的密码。

The first line contains two integers $n$ and $m$ ($1 \le n, m \le 10$) representing the number of digits in the sequence you have and the number of keys on the keypad that have fingerprints.

The next line contains $n$ distinct space-separated integers $x_1, x_2, \ldots, x_n$ ($0 \le x_i \le 9$) representing the sequence.

The next line contains $m$ distinct space-separated integers $y_1, y_2, \ldots, y_m$ ($0 \le y_i \le 9$) — the keys with fingerprints.

第一行包含两个整数 $n$ 和 $m$（$1 \le n, m \le 10$），分别表示你所拥有的数字序列的位数，以及键盘上留有指纹的按键数量。

第二行包含 $n$ 个互不相同的、以空格分隔的整数 $x_1, x_2, \ldots, x_n$（$0 \le x_i \le 9$），表示该数字序列。

第三行包含 $m$ 个互不相同的、以空格分隔的整数 $y_1, y_2, \ldots, y_m$（$0 \le y_i \le 9$）——这些是留有指纹的按键。

In a single line print a space-separated sequence of integers representing the code. If the resulting sequence is empty, both printing nothing and printing a single line break is acceptable.

在一行中输出一个空格分隔的整数序列，表示该编码。如果所得序列为空，则不输出任何内容或仅输出一个换行符均可接受。

In the first example, the only digits with fingerprints are $1$, $2$ and $7$. All three of them appear in the sequence you know, $7$ first, then $1$ and then $2$. Therefore the output is 7 1 2. Note that the order is important, and shall be the same as the order in the original sequence.

In the second example digits $0$, $1$, $7$ and $9$ have fingerprints, however only $0$ and $1$ appear in the original sequence. $1$ appears earlier, so the output is 1 0. Again, the order is important.

在第一个例子中，具有指纹的数字仅有 $1$、$2$ 和 $7$。这三个数字均出现在你所知道的序列中，顺序为：先出现 $7$，然后是 $1$，最后是 $2$。因此输出为 7 1 2。注意，顺序至关重要，必须与原始序列中的出现顺序一致。

在第二个例子中，数字 $0$、$1$、$7$ 和 $9$ 具有指纹，但只有 $0$ 和 $1$ 出现在原始序列中。其中 $1$ 出现得更早，因此输出为 1 0。同样，顺序至关重要。