codeforces 599B Spongebob and Joke

B. 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 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 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.

#include<cstdio>
#include<algorithm>
using namespace std;
const int maxn=1000005;
int vis[maxn][2],a[maxn],ans[maxn];
int main()
{
    int m,n;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        scanf("%d",&a[i]);
        if(vis[a[i]][0])
        {
            vis[a[i]][1]=1;//vis[a[i][1]用来标记这个数已经出现过
            continue;
        }
        vis[a[i]][0]=i;
    }
    int key=1;
    for(int i=0;i<m;i++)
    {
        int t;
        scanf("%d",&t);
        if(vis[t][0])
        {
            if(vis[t][1])
                key=2;
            ans[i]=vis[t][0];
        }
        else
        {
            key=0;
            break;
        }
    }
    if(!key)
        puts("Impossible");
    else if(key==2)
        puts("Ambiguity");
    else
    {
        puts("Possible");
        for(int i=0;i<m;i++)
            printf("%d ",ans[i]);
    }
    return 0;
}