#include<bits/stdc++.h>
using namespace std;
const int N=2e5+2;
vector<int> g[N];
int a[N],s[N],d[N],c[N];
bool vis[N];
void dfs(int x,int num){
	vis[x]=1;
	c[x]=num;
	for(int i=0;i<g[x].size();i++){
		int u=g[x][i];
		if(vis[u]) continue;
		dfs(u,num);
	}
}
int main()
{
	freopen("Chase.in","r",stdin);
	freopen("Chase.out","w",stdout);
	int n,f;
	cin>>n>>f;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		g[i].push_back(a[i]);
		g[a[i]].push_back(i);
	} 
	for(int i=1;i<=n;i++) d[i];
	for(int i=1;i<=f;i++) cin>>s[i];
	int tot=0;
	for(int i=1;i<=n;i++) {
		if(vis[i]) continue;
		tot++;
		dfs(i,tot);
	}
	cout<<-1<<endl<<0<<endl<<-2<<endl<<-2;
	return 0;
}