Codeforces 599B-----思维题

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₁, a₂, ..., a_m of length m, consisting of integers from 1 to n, not necessarily distinct. Then he picked some sequence f₁, f₂, ..., f_n of length n and for each number a_i got number b_i = f_ai. 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.

Input

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₁, f₂, ..., f_n (1 ≤ f_i ≤ n).

The last line contains m integers, determining sequence b₁, b₂, ..., b_m(1 ≤ b_i ≤ n).

Output

Print "Possible" if there is exactly one sequence a_i, such that b_i = f_ai for all i from 1 to m. Then print m integers a₁, a₂, ..., 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".

Sample Input

Input

3 3
3 2 1
1 2 3

Output

Possible
3 2 1 

Input

3 3
1 1 1
1 1 1

Output

Ambiguity

Input

3 3
1 2 1
3 3 3

Output

Impossible

就是对应的两个序列，b[i] = f[a[i]]，已知b[i]和f[i]问是否能求出a[i]序列

例如样例1:

f[i]-->3 2 1 b[i]-->1 2 3

b[1] = 1 = f[3] = f[a[1]] --> a[1]  = 3，依次类推可求出有唯一序列a[i]

若一个b[i]对应多个f[i]则不能唯一确定a[i]，如样例二

若b[i]没有对应的f[i]，则不能推出a[i]，如样例三

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int f[200010], b[200010], fin[200210], ju[200010];
int main(){
	int m, n, a, c, t;
	scanf("%d%d", &n, &m);
	for(int i = 0; i < n; i++){
		scanf("%d", &t);
		f[t]++;//记录f序列中各个数出现的次数
		fin[t] = i;//记录f序列各个数对应的位置，即a[i]的值
	}
	for(int i = 0; i < m; i++){
		scanf("%d", &b[i]);
	}
	a = c = t = 0;
	for(int i = 0; i < m; i++){
		if(f[b[i]] == 0){//b序列对应数字在f序列没有出现，不能推出a序列
			a++;
			break;
		}
		if(f[b[i]] > 1){//出现多次，不确定，但是不能退出，因为不能推出比不确定优先级高
			c++;
		}
		ju[t++] = fin[b[i]];//ju数组即为a序列由1到m顺序排列，但值比实际值少1，因为数组下标
	}
	if(a){
		printf("Impossible\n");
	}
	else if(c){
		printf("Ambiguity\n");
	}
	else{
		printf("Possible\n");
		for(int i = 0; i < m; i++){
			printf("%d", ju[i] + 1);//在这加上即可
			if(i != m-1){
				printf(" ");
			}
		}
		printf("\n");
	}
	return 0;
}