#include <bits/stdc++.h>
#define N 1000011
using namespace std;
int n,k,q,t,r1,r2;
struct Tree
{
	vector<int> G[N];
	int R,fa[N],dfn[N],rk[N],son[N],dep[N],siz[N],top[N],clk;
	void dfs1(int u,int F)
	{
		dep[u]=dep[F]+1;siz[u]=1;fa[u]=F;
		for(int v:G[u])if(v^F)
		{
			dfs1(v,u),siz[u]+=siz[v];
			if(siz[v]>siz[son[u]])son[u]=v;
		}
	}
	void dfs2(int u,int tp)
	{
		top[u]=tp;dfn[u]=++clk;rk[clk]=u;if(son[u])dfs2(son[u],tp);
		for(int v:G[u])if(v^son[u]&&v^tp)dfs2(v,v);
	}
	int lca(int u,int v)
	{
		while(top[u]^top[v])
		{
			if(dep[top[u]]>dep[top[v]])u=fa[top[u]];else v=fa[top[v]];
		}
		return dep[u]<dep[v]?u:v;
	}
	void init(){dfs1(R,0);dfs2(R,R);}
	vector<pair<int,int>> E[N];
	bool vis[N];int dis[N];
	void dfs(int u)
	{
		for(auto [v,w]:E[u])if(!vis[v])
		{
			dis[v]=dis[u]+w;vis[v]=1;
			dfs(v);
		}
	}
	void proc()
	{
		for(int i=1;i<=n;++i)if(!vis[i])vis[i]=1,dfs(i);
	}
}T1,T2;
vector<int> vv;
int ans[N][2];
int main()
{
	scanf("%d%d%d%d",&n,&k,&q,&t);
	for(int i=1;i<=n;++i){int fa;scanf("%d",&fa);if(~fa)T1.G[fa].push_back(i);else T1.R=i;}
	for(int i=1;i<=n;++i){int fa;scanf("%d",&fa);if(~fa)T2.G[fa].push_back(i);else T2.R=i;}
	T1.init();T2.init();
	for(int i=1;i<=k;++i)printf("%d ",T1.rk[i]),vv.push_back(T2.dfn[T1.rk[i]]);putchar(10);fflush(stdout);
	sort(vv.begin(),vv.end());
	for(int i=0;i+1<k;++i)
	{
		int x=T2.rk[vv[i]],y=T2.rk[vv[i+1]];
		printf("? %d %d\n",x,y);
	}
	printf("!\n");fflush(stdout);
	for(int i=0;i+1<k;++i)
	{
		int x=T2.rk[vv[i]],y=T2.rk[vv[i+1]];
		int d1,d2,d3,d4;
		scanf("%d%d%d%d",&d1,&d2,&d3,&d4);
		int L1=T1.lca(x,y),L2=T2.lca(x,y);
		T1.E[L1].push_back({x,d1});T1.E[x].push_back({L1,-d1});
		T1.E[L1].push_back({y,d2});T1.E[y].push_back({L1,-d2});
		T2.E[L2].push_back({x,d3});T2.E[x].push_back({L2,-d3});
		T2.E[L2].push_back({y,d4});T2.E[y].push_back({L2,-d4});
	}
	T1.proc();T2.proc();
	for(int i=1;i<=t;++i)
	{
		int x,y;scanf("%d%d",&x,&y);
		ans[i][0]=T1.dis[x]+T1.dis[y]-2*T1.dis[T1.lca(x,y)];ans[i][1]=T2.dis[x]+T2.dis[y]-2*T2.dis[T2.lca(x,y)];
	}
	for(int i=1;i<=t;++i)printf("%d %d\n",ans[i][0],ans[i][1]);fflush(stdout);
}