#include <bits/stdc++.h>
#define int long long
using namespace std;
int n,m,f[100010],b[100010],f_num[100010],f_where[100010];
signed main()
{
cin>>n>>m;
for(int i=1;i<=n;i++)
{
cin >> f[i];
f_num[f[i]]++,f_where[f[i]] = i;
}
for(int i=1;i<=m;i++)
{
cin>>b[i];
if(!f_where[b[i]])
{
cout << "Impossible";
return 0;
}
}
for(int i=1;i<=m;i++)
if(f_num[b[i]]>1)
{
cout<<"Ambiguity";
return 0;
}
cout << "Possible"<<endl;
for(int i=1;i<=m;i++) cout<<f_where[b[i]]<<" ";
return 0;
}
5. Longest Palindromic Substring | 3. Longest Substring Without Repeating Characters |
1312. Minimum Insertion Steps to Make a String Palindrome | 1092. Shortest Common Supersequence |
1044. Longest Duplicate Substring | 1032. Stream of Characters |
987. Vertical Order Traversal of a Binary Tree | 952. Largest Component Size by Common Factor |
212. Word Search II | 174. Dungeon Game |
127. Word Ladder | 123. Best Time to Buy and Sell Stock III |
85. Maximal Rectangle | 84. Largest Rectangle in Histogram |
60. Permutation Sequence | 42. Trapping Rain Water |
32. Longest Valid Parentheses | Cutting a material |
Bubble Sort | Number of triangles |
AND path in a binary tree | Factorial equations |
Removal of vertices | Happy segments |
Cyclic shifts | Zoos |
Build a graph | Almost correct bracket sequence |
Count of integers | Differences of the permutations |