# Codeforces Round #332 (Div. 2) B. Spongebob and Joke

time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

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 a1, a2, ..., am of length m, consisting of integers from 1 to n, not necessarily distinct. Then he picked some sequence f1, f2, ..., fn of length n and for each number ai got number bi = fai. To finish the prank he erased the initial sequence ai.

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 fi and bi respectively.

The second line contains n integers, determining sequence f1, f2, ..., fn (1 ≤ fi ≤ n).

The last line contains m integers, determining sequence b1, b2, ..., bm (1 ≤ bi ≤ n).

Output

Print "Possible" if there is exactly one sequence ai, such that bi = fai for all i from 1 to m. Then print m integers a1, a2, ..., am.

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

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

Sample test(s)
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

Note

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 fi ≠ 3 for all i, so no sequence ai transforms into such bi and we can say for sure that Spongebob has made a mistake.

b[m]数列有的数，f[n]没有

b[m]数列有的数，f[n]全都有且其中有一个至少有两个

b[m]数列有的数，f[n]都有且f[n]中只有一个

#include
#include
#include
#include
using namespace std;

const int N = 100001;

int f[N];
int b[N];
int a[N];

struct node
{
int i;
int n;
}flag[N];   //flag[i].n 表示i出现的个数，flag[i].i表示i最后出现的位置

int main(void)
{
int n, m;
while(~scanf("%d%d", &n, &m))
{
int i;
int ans = 0;
memset(flag, 0, sizeof(flag));
for(i = 1; i <= n; i++)
{
scanf("%d", &f[i]);
flag[ f[i] ].i = i;
flag[ f[i] ].n++;
}

for(i = 1; i <= m; i++)
{
scanf("%d", &b[i]);
if( flag[ b[i] ].n == 0)
{
ans = 1;
}
}
if(ans)          printf("Impossible\n");
else
{
for(i = 1; i <= m; i++)
{
a[i] = flag[ b[i] ].i;
if(flag[ b[i] ].n > 1) ans = 1;
}
if(ans) printf("Ambiguity\n");
else
{

printf("Possible\n");
for(i = 1; i <= m; i++) printf("%d ", a[i]);
printf("\n");
}
}
}
return 0;
}


• 本文已收录于以下专栏：

举报原因： 您举报文章：Codeforces Round #332 (Div. 2) B. Spongebob and Joke 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)