#include<bits/stdc++.h>
using namespace std;
#define debug puts("YES");
#define rep(x,y,z) for(int (x)=(y);(x)<(z);(x)++)
#define ll long long
#define ull unsigned long long
#define lrt int l,int r,int rt
#define lson l,mid,rt<<1
#define rson mid+1,r,rt<<1|1
#define root l,r,rt
#define mst(a,b) memset((a),(b),sizeof(a))
#define pii pair<int,int>
#define piii pair<int,pii>
#define fi first
#define se second
#define mk(x,y) make_pair(x,y)
#define base 2333
const int mod=1e9+7;
const int maxn=1e5+10;
const int ub=1e6;
ll powmod(ll x,ll y){ll t; for(t=1;y;y>>=1,x=x*x%mod) if(y&1) t=t*x%mod; return t;}
ll gcd(ll x,ll y){
if(y==0) return x;
return gcd(y,x%y);
}
map<int,int> mp,mp2;
int m,n,a[maxn],b[maxn],nxt[maxn],tot=0;
int gao(int x){
if(mp[x]) return mp[x];
else {
mp[x]=++tot;
mp2[tot]=x;
return tot;
}
}
void solve(int l1,int r1,int l2,int r2,int pre){
if(l1>r1||l2>r2) return ;
int ret=b[l2],idx=l1;
nxt[ret]=pre;
while(a[idx]!=ret) idx++;
solve(l1,idx-1,l2+1,l2+idx-l1,ret);
solve(idx+1,r1,l2+idx-l1+1,r2,ret);
}
int vis[maxn];
int LCA(int x,int y){
if(x==y) return x;
mst(vis,0);
vis[x]=1;
while(x!=nxt[x])x=nxt[x],vis[x]=1;
while(vis[y]==0) y=nxt[y];
return y;
}
int main(){
scanf("%d%d",&m,&n);
rep(i,1,n+1) {
scanf("%d",&a[i]);
a[i]=gao(a[i]);
}
rep(i,1,n+1) {
scanf("%d",&b[i]);
b[i]=gao(b[i]);
}
solve(1,n,1,n,b[1]);
rep(i,0,m){
int x,y,f1=0,f2=0;
scanf("%d%d",&x,&y);
///x=mp[x],y=mp[y];
if(mp[x]==0) f1=1;
if(mp[y]==0) f2=1;
if(f1&&f2){
printf("ERROR: %d and %d are not found.\n",x,y);
}else if(f1){
printf("ERROR: %d is not found.\n",x);
}else if(f2){
printf("ERROR: %d is not found.\n",y);
}else{
int ret=LCA(mp[x],mp[y]);
ret=mp2[ret];
if(ret==x){
printf("%d is an ancestor of %d.\n",x,y);
}else if(ret==y){
printf("%d is an ancestor of %d.\n",y,x);
}else{
printf("LCA of %d and %d is %d.\n",x,y,ret);
}
}
}
return 0;
}