#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int maxn = 1e5+;

int f[maxn], b[maxn], a[maxn];

int g[maxn];

bool mul[maxn];

//#define LOCAL

int main()

{

#ifdef LOCAL

    freopen("in.txt","r",stdin);

#endif

    int n, m; scanf("%d%d",&n,&m);

    bool Abm = false;

    for(int i = ; i <= n; i++){

        scanf("%d", f+i);

        if(g[f[i]]) mul[f[i]] = true;

        g[f[i]] = i;

    }

    for(int i = ; i <= m; i++){

        scanf("%d", b+i);

    }

    bool Imp = false;

    for(int i = ; i <= m; i++){

        if(!g[b[i]]) {

            Imp = true; break;

        }

        if(mul[b[i]]){

            Abm = true;

        }

        a[i] = g[b[i]];

    }

    if(Imp) puts("Impossible");

    else {

        if(Abm) puts("Ambiguity");

        else {

            puts("Possible");

            for(int i = ; i <= m; i++){

                printf("%d%c", a[i], i != m? ' ': '\n');

            }

        }

    }

    return ;

}