CF599B.Spongebob and Joke

While Patrick was gone shopping, Spongebob decided to play a little trick on his friend. The naughty Sponge browsed through Patrick's personal stuff and found a sequence _a_1, _a_2, ..., a__m of length m, consisting of integers from 1 to n, not necessarily distinct. Then he picked some sequence _f_1, _f_2, ..., f__n of length n and for each number a__i got number b__i = f__a__i. To finish the prank he erased the initial sequence a__i.

It's hard to express how sad Patrick was when he returned home from shopping! We will just say that Spongebob immediately got really sorry about what he has done and he is now trying to restore the original sequence. Help him do this or determine that this is impossible.

当派特里克外出购物时，海绵宝宝决定对他的朋友开个小玩笑。顽皮的海绵宝宝翻看了派特里克的私人物品，发现了一个长度为 $m$ 的序列 $a_1,\ a_2,\ \dots,\ a_m$，其中每个元素均为 $1$ 到 $n$ 之间的整数（允许重复）。接着，他选取了一个长度为 $n$ 的序列 $f_1,\ f_2,\ \dots,\ f_n$，并对每个数 $a_i$ 计算出 $b_i = f_{a_i}$。最后，他擦除了原始序列 $a_i$。

派特里克购物回家后感到多么悲伤，实在难以言表！我们只需说明：海绵宝宝立刻为自己所做之事深感愧疚，现在正努力恢复原始序列。请帮助他完成这一任务，或判断这是不可能的。

The first line of the input contains two integers n and m (1 ≤ n, m ≤ 100 000) — the lengths of sequences f__i and b__i respectively.

The second line contains n integers, determining sequence _f_1, _f_2, ..., f__n (1 ≤ f__i ≤ n).

The last line contains m integers, determining sequence _b_1, _b_2, ..., b__m (1 ≤ b__i ≤ n).

输入的第一行包含两个整数 $n$ 和 $m$（$1 \leq n, m \leq 100\,000$），分别表示序列 $f_i$ 和 $b_i$ 的长度。

第二行包含 $n$ 个整数，确定序列 $f_1,\,f_2,\,\dots,\,f_n$（$1 \leq f_i \leq n$）。

最后一行包含 $m$ 个整数，确定序列 $b_1,\,b_2,\,\dots,\,b_m$（$1 \leq b_i \leq n$）。

Print "Possible" if there is exactly one sequence a__i, such that b__i = f__a__i for all i from 1 to m. Then print m integers _a_1, _a_2, ..., a__m.

If there are multiple suitable sequences a__i, print "Ambiguity".

If Spongebob has made a mistake in his calculations and no suitable sequence a__i exists, print "Impossible".

如果恰好存在一个序列 $a_i$，使得对所有从 $1$ 到 $m$ 的 $i$ 均满足 $b_i = f_{a_i}$，则输出 "Possible"，然后输出 $m$ 个整数 $a_1,\ a_2,\ \dots,\ a_m$。

如果存在多个满足条件的序列 $a_i$，则输出 "Ambiguity"。

如果海绵宝宝在计算中出错，即不存在任何满足条件的序列 $a_i$，则输出 "Impossible"。

In the first sample 3 is replaced by 1 and vice versa, while 2 never changes. The answer exists and is unique.

In the second sample all numbers are replaced by 1, so it is impossible to unambiguously restore the original sequence.

In the third sample f__i ≠ 3 for all i, so no sequence a__i transforms into such b__i and we can say for sure that Spongebob has made a mistake.

在第一个样例中，3 被替换为 1，反之亦然，而 2 始终保持不变。答案存在且唯一。

在第二个样例中，所有数字均被替换为 1，因此无法明确还原原始序列。

在第三个样例中，对所有 $i$ 均有 $f_i \neq 3$，因此不存在任何序列 $a_i$ 能变换为这样的 $b_i$，我们可以确定海绵宝宝出错了。