#include <bits/stdc++.h>
using namespace std;
template <class T>
inline void remax(T& A, T B) {
  if (A < B) A = B;
}
template <class T>
inline void remin(T& A, T B) {
  if (A > B) A = B;
}
string ToString(long long num) {
  string ret;
  do {
    ret += ((num % 10) + '0');
    num /= 10;
  } while (num);
  reverse(ret.begin(), ret.end());
  return ret;
}
long long ToNumber(string s) {
  long long r = 0, p = 1;
  for (int i = s.size() - 1; i >= 0; --i) r += (s[i] - '0') * p, p *= 10;
  return r;
}
long long Gcd(long long a, long long b) {
  while (a %= b ^= a ^= b ^= a)
    ;
  return b;
}
long long Power(long long base, long long power) {
  long long ret = 1;
  while (power) {
    if (power & 1) ret *= base;
    power >>= 1;
    base *= base;
  }
  return ret;
}
long long PowerMod(long long base, long long power, long long mod) {
  if (!power) return 1;
  if (power & 1) return (base * PowerMod(base, power - 1, mod)) % mod;
  return PowerMod((base * base) % mod, power >> 1, mod);
}
int Log(long long num, long long base) {
  int ret = 0;
  while (num) {
    ++ret;
    num /= base;
  }
  return ret;
}
int Count(long long mask) {
  int ret = 0;
  while (mask) {
    if (mask & 1) ++ret;
    mask >>= 1;
  }
  return ret;
}
int arr1[100000];
int arr2[100000];
int ans[100000];
inline void run() {
  map<int, int> ma1, ma2;
  map<int, int> ind1;
  int n, m;
  scanf("%d%d", &n, &m);
  for (int i = 0; i < n;) scanf("%d", arr1 + i++);
  for (int i = 0; i < m;) scanf("%d", arr2 + i++);
  for (int i = 0; i < n; ++i) ++ma1[arr1[i]];
  for (int i = 0; i < m; ++i) ++ma2[arr2[i]];
  for (int i = 0; i < m; ++i)
    if (ma1.find(arr2[i]) == ma1.end()) return (void)puts("Impossible");
  for (int i = 0; i < m; ++i)
    if (ma1[arr2[i]] > 1) return (void)puts("Ambiguity");
  for (int i = 0; i < n; ++i) ind1[arr1[i]] = i;
  for (int i = 0; i < m; ++i) ans[i] = ind1[arr2[i]];
  puts("Possible");
  for (int i = 0; i < m; ++i) {
    if (i) putchar(' ');
    printf("%d", ++ans[i]);
  }
  puts("");
}
int main() {
  FILE* input = stdin;
  FILE* output = stdout;
  while (!feof(input)) {
    run();
    break;
  }
  return 0;
}
