#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll inf=1e18;
const int N=250005;
void chkmin(ll &x,ll y){
	x=min(x,y);
}
ll k,L;
ll val(ll len){
	if(len<=k)return len;
	ll p=len/k,t=len-p*k;
	ll ans=(t+t+p*k)*(p+1);
	ans-=len;
	return ans;
}
ll v1(ll len){
	if(len<=k)return len;
	ll p=len/k,ans=inf,pos;
	pos=(p/2)*k,ans=val(pos)+val(len-pos+k)-k;
	pos=(p/2+1)*k,chkmin(ans,val(pos)+val(len-pos+k)-k);
	return ans;
}
ll v2(ll len){
	if(len<=k)return len*2;
	ll p=len/k,ans=inf,pos;
	pos=(p/2)*k,ans=val(pos)+val(len-pos)+len;
	pos=(p/2+1)*k,chkmin(ans,val(pos)+val(len-pos)+len);
	return ans;
}
ll v3(ll len){
	if(len==0)return 1e18;
	if(len<=k)return len;
	if(len<=2*k)return len+len-k;
	ll p=len/k,ans=inf,pos;
	pos=(p/2)*k,ans=val(pos)+val(len-pos)+min(pos,len-pos);
	pos=(p/2+1)*k,chkmin(ans,val(pos)+val(len-pos)+min(pos,len-pos));
	return ans;
}
int n;
mt19937 rnd(163337);
ll a1[N],a2[N],a3[N],a4[N],a5[N];
ll mn[N],mn2[N],s1[N],s2[N];
ll tag[N],tag2[N];
int pri[N],ls[N],rs[N],siz[N],rt,tot;
unordered_map<int, int> mp;
void update(int p){
	siz[p]=siz[ls[p]]+siz[rs[p]]+1;
	mn[p]=min({mn[ls[p]],mn[rs[p]],a4[p]});
	mn2[p]=min({mn2[ls[p]],mn2[rs[p]],a5[p]});
	s1[p]=s1[ls[p]]+s1[rs[p]]+a1[p];
	s2[p]=s2[ls[p]]+s2[rs[p]]+a2[p];
	mn[0]=mn2[0]=inf;
}
#define push(p,v) (a4[p]+=v,mn[p]+=v,tag[p]+=v)
#define push2(p,v) (a5[p]+=v,mn2[p]+=v,tag2[p]+=v)
void pushdown(int p){
	if(tag[p]){
		push(ls[p],tag[p]);
		push(rs[p],tag[p]);
		tag[p]=0;
	}
	if(tag2[p]){
		push2(ls[p],tag2[p]);
		push2(rs[p],tag2[p]);
		tag2[p]=0;
	}
}
void split(int p,int v,int &x,int &y){
	if(!p)return x=y=0,void();
	pushdown(p);
	if(siz[ls[p]]+1<=v)
		x=p,split(rs[p],v-siz[ls[p]]-1,rs[x],y);
	else y=p,split(ls[p],v,x,ls[y]);
	update(p);
}
int merge(int x,int y){
	if(!x||!y)return x|y;
	pushdown(x),pushdown(y);
	if(pri[x]<=pri[y]){
		rs[x]=merge(rs[x],y);
		update(x);
		return x;
	}
	else{
		ls[y]=merge(x,ls[y]);
		update(y);
		return y;
	}
}
ll _ans1,_ans2,_ans3,_ans4;
void ins(ll a1,ll a2,ll a3,ll a4){
	_ans1+=a1,_ans2+=a2;
	chkmin(_ans3,a3);
	chkmin(_ans4,a4);
}
void qry(int x,int y,int l,int r,int p){
	if(l<=x&&r>=y){
		ins(s1[p],s2[p],mn[p],mn2[p]);
		return;
	}
	pushdown(p);
	int mid=x+siz[ls[p]];
	if(l<=mid&&r>=mid)ins(a1[p],a2[p],a4[p],a5[p]);
	if(l<=mid-1)qry(x,mid-1,l,r,ls[p]);
	if(r>mid)qry(mid+1,y,l,r,rs[p]);
	//[x,mid-1] mid [mid+1,y]
}
set<ll> s,_s;//下标
ll xp[N],Sz;
void qry(int l,int r){
	_ans1=_ans2=0;
	_ans3=_ans4=inf;
	if(l>r)return;
	qry(1,siz[rt],l,r,rt);
}
void calc(int x,int y,int z,ll d){
	ll vv1=v1(d),vv2=v2(d);
	ll dt1=vv1-a1[y];
	ll dt2=vv2-a2[y];
	a4[y]-=a3[y];
	a5[y]-=a3[y];
	a1[y]=s1[y]=vv1;
	a2[y]=s2[y]=vv2;
	a3[y]=v3(d);
	a4[y]+=a3[y];
	a5[y]+=a3[y];
	mn[y]=a4[y];
	mn2[y]=a5[y];
	push(z,dt1);
	push(x,dt2);
	push2(z,dt2);
	push2(x,dt1);
}
void mdf(int i,ll d){
	int x,y,z,w;
	split(rt,i,w,z);
	split(w,i-1,x,y);
	//修改y
	calc(x,y,z,d);
	w=merge(x,y);
	rt=merge(w,z);
	//单点修改
}//将d[i]改为d
struct bit{
	#define lb(x) ((x)&(-(x)))
	int b[N];
	void add(int x,int v){
		for(;x<=n;x+=lb(x))
			b[x]+=v;
	}
	int qry(int x){
		int ans=0;
		for(;x;x-=lb(x))
			ans+=b[x];
		return ans;
	}
	#undef lb
}tree;
int findlst(int x){
	auto it=s.lower_bound(x);
	if(it==s.begin())return 0;
	else return *(--it);
}
int findnxt(int x){
	auto it=s.upper_bound(x);
	if(it==s.end())return n+1;
	else return *it;
}
int findlst2(int x){
	auto it=_s.lower_bound(x);
	if(it==_s.begin())return 0;
	else return mp[*(--it)];
}
int findnxt2(int x){
	auto it=_s.lower_bound(x);
	if(it==_s.end())return L+1;
	else return mp[*it];
}
vector<int> DEL;
void ins(int i){
	int lst=findlst(i),rk=0;
	int nxt=findnxt(i);
	ll d=(nxt==n+1?0ll:xp[nxt]-xp[i]);
	if(lst){
		rk=tree.qry(lst);
		ll d=xp[i]-xp[lst];
		mdf(rk,d);
	}
	int x,y,p;
	if(DEL.size()){
		p=DEL.back();
		DEL.pop_back();
		ls[p]=rs[p]=tag[p]=0;
	}
	else p=++tot;
	qry(1,rk);
	ll As1=_ans1,As2=_ans2;
	qry(rk+1,Sz-1);
	ll Bs1=_ans1,Bs2=_ans2;
	pri[p]=rnd();
	siz[p]=1;
	a1[p]=s1[p]=0;
	a2[p]=s2[p]=0;
	a3[p]=1e18;
	a4[p]=mn[p]=Bs2+As1+a3[p];
	a5[p]=mn2[p]=As2+Bs1+a3[p];
	split(rt,rk,x,y);
	calc(x,p,y,d);
	x=merge(x,p);
	rt=merge(x,y);
	s.insert(i);
	_s.insert(xp[i]);
	tree.add(i,1);
	Sz++;
}
void del(int i){
	int lst=findlst(i),rk=0;
	int nxt=findnxt(i);
	if(lst){
		rk=tree.qry(lst);
		ll d=(nxt==n+1?0:xp[nxt]-xp[lst]);
		mdf(rk,d);
	}
	rk++;
	int x,y,z,w;
	split(rt,rk,w,z);
	split(w,rk-1,x,y);
	calc(x,y,z,0);
	rt=merge(x,z);
	DEL.push_back(y);
	s.erase(i);
	_s.erase(xp[i]);
	tree.add(i,-1);
    Sz--;
}
ll solve(int i){
	int rk=tree.qry(i);
	ll Ld=*(_s.begin()),Rd=L-*(--_s.end());
	qry(1,rk-1);
	ll As1=_ans1,As2=_ans2,As3=_ans3,As4=_ans4;
	qry(rk,Sz-1);
	ll Bs1=_ans1,Bs2=_ans2,Bs3=_ans3,Bs4=_ans4;
	ll vLd=val(Ld),vRd=val(Rd);
	ll ret1=vLd+Ld+As2;
	ll ret2=vRd+Bs1;
	ll ret3=vRd+Rd-As1+Bs3;
	ll ans=ret1+min(ret2,ret3);
	ret1=vRd+Rd+Bs2;
	ret2=vLd+As1;
	ret3=vLd+Ld-Bs1+As4;
	ans=min(ans,ret1+min(ret2,ret3));
	return ans;
}
ll work(int pos){
	ll ans=inf;
	int lst=findlst2(pos);
	if(lst)ans=min(ans,solve(lst)+pos-xp[lst]);
	int nxt=findnxt2(pos);
	if(nxt!=L+1)ans=min(ans,solve(nxt)+xp[nxt]-pos);
	return ans;
}
int Q;
namespace IO
{
	#define gc()(xS==xTT&&(xTT=(xS=xB)+fread(xB,1,1<<20,stdin),xS==xTT)?0:*xS++)
	#define pc(x)(p3-obuf<1000000)?(*p3++=x):(fwrite(obuf,p3-obuf,1,stdout),p3=obuf,*p3++=x)
	char xch,xB[1<<20],*xS=xB,*xTT=xB,obuf[1000000],*p3=obuf;
	inline ll read()
	{
		char ch=gc();ll x=0,f=1;
		while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=gc();}
		while('0'<=ch&&ch<='9'){x=(x<<1)+(x<<3)+(ch^48);ch=gc();}
		return x*f;
	}
}
using IO::read;
int main(){
	mn[0]=inf;
	mn2[0]=inf;
	cin>>n>>L>>k>>Q;ll x;
	for(int i=1;i<=n;++i){
		x=read();
		xp[i]=x;
		mp[x]=i;
	}
	for(int i=1;i<=n;++i)
		ins(i);
	while(Q--){
		int z,u,p,x;
		z=read(),u=read(),p=read();
		for(int i=1;i<=z;++i)
			x=read(),ins(x);
		for(int i=1;i<=u;++i)
			x=read(),del(x);
		printf("%lld\n",work(p));
	}
}