#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,chkmin(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,chkmin(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,chkmin(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);
struct T{
	ll a1[N],a2[N],a3[N],a4[N];
	ll mn[N],s1[N],s2[N];
	ll tag[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]});
		s1[p]=s1[ls[p]]+s1[rs[p]]+a1[p];
		s2[p]=s2[ls[p]]+s2[rs[p]]+a2[p];
		mn[0]=inf;
	}
	void push(int p,ll v){
		a4[p]+=v,mn[p]+=v,tag[p]+=v;
	}
	void pushdown(int p){
		if(tag[p]){
			push(ls[p],tag[p]);
			push(rs[p],tag[p]);
			tag[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 qry1(int l,int r){
		if(l>r)return 0;
		int x,y,z,w;
		split(rt,r,w,z);
		split(w,l-1,x,y);
		ll ret=s1[y];
		w=merge(x,y);
		rt=merge(w,z);
		return ret;
	}
	ll qry2(int l,int r){
		if(l>r)return 0;
		int x,y,z,w;
		split(rt,r,w,z);
		split(w,l-1,x,y);
		ll ret=s2[y];
		w=merge(x,y);
		rt=merge(w,z);
		return ret;
	}
	ll qry3(int l,int r){
		if(l>r)return inf;
		int x,y,z,w;
		split(rt,r,w,z);
		split(w,l-1,x,y);
		ll ret=mn[y];
		w=merge(x,y);
		rt=merge(w,z);
		return ret;
	}
	void mdf(int i,ll d){
		int x,y,z,w;
		split(rt,i,w,z);
		split(w,i-1,x,y);
		//修改y
		ll dt1=v1(d)-a1[y];
		ll dt2=v2(d)-a2[y];
		a4[y]-=a3[y];
		a1[y]=s1[y]=v1(d);
		a2[y]=s2[y]=v2(d);
		a3[y]=v3(d);
		a4[y]+=a3[y];
		mn[y]=a4[y];
		push(z,dt1);
		push(x,dt2);
		w=merge(x,y);
		rt=merge(w,z);
		//单点修改
	}//将d[i]改为d
	set<ll> s,_s;//下标
	ll xp[N],Sz;
	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;
		pri[p]=rnd();
		siz[p]=1;
		a1[p]=s1[p]=0;
		a2[p]=s2[p]=0;
		a3[p]=1e18;
		a4[p]=mn[p]=qry2(rk+1,Sz-1)+qry1(1,rk)+a3[p];
		split(rt,rk,x,y);
		x=merge(x,p);
		rt=merge(x,y);
		mdf(rk+1,d);
		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++;
		mdf(rk,0);
		int x,y,z,w;
		split(rt,rk,w,z);
		split(w,rk-1,x,y);
		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());
		ll ret1=val(Ld)+Ld+qry2(1,rk-1);
		ll ret2=val(Rd)+qry1(rk,Sz-1);
		ll ret3=val(Rd)+Rd-qry1(1,rk-1)+qry3(rk,Sz-1);
		return ret1+min(ret2,ret3);
	}
	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;
	}
}_[2];
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(){
	_[0].mn[0]=inf;
	_[1].mn[0]=inf;
	cin>>n>>L>>k>>Q;ll x;
	for(int i=1;i<=n;++i){
		x=read();
		_[0].xp[i]=x;
		_[1].xp[n-i+1]=L-x;
		_[0].mp[x]=i;
		_[1].mp[L-x]=n-i+1;
	}
	for(int i=1;i<=n;++i){
		_[0].ins(i);
		_[1].ins(i);
	}
	while(Q--){
		int z,u,p,x;
		z=read(),u=read(),p=read();
		for(int i=1;i<=z;++i)
			x=read(),_[0].ins(x),_[1].ins(n-x+1);
		for(int i=1;i<=u;++i)
			x=read(),_[0].del(x),_[1].del(n-x+1);
		printf("%lld\n",min(_[0].work(p),_[1].work(L-p)));
//		printf("%lld\n",_[0].work(p));
//		printf("%lld\n",_[1].work(L-p));
	}
}