//OccDreamer
#include<bits/stdc++.h>

#define vc vector
#define db double
#define fi first
#define se second
#define ll long long
#define mk make_pair
#define pb push_back
#define RI register int
#define PI pair<int,int>
#define ull unsigned long long
#define err cerr << "   -_-   " << endl
#define debug cerr << " ------------------- " << endl

#define input(x) freopen(#x".in","r",stdin)
#define output(x) freopen(#x".out","w",stdout)

#define NO puts("No")
#define YES puts("Yes")

//#define OccDreamer
//#define int long long

using namespace std;

namespace IO{
	inline ll read(){
		ll X=0, W=0; char ch=getchar();
		while(!isdigit(ch)) W|=ch=='-', ch=getchar();
		while(isdigit(ch)) X=(X<<1)+(X<<3)+(ch^48), ch=getchar();
		return W?-X:X;
	}
	inline void write(ll x){
		if(x<0) x=-x, putchar('-');
		if(x>9) write(x/10);
		putchar(x%10+'0');
	}
	inline void sprint(ll x){write(x), putchar(32);}
	inline void eprint(ll x){write(x), putchar(10);}
}using namespace IO;

const int MAXN = 3e5+5;
const int mod = 998244353;

int n, q, z, tot;

ll pre[MAXN], w[MAXN], sum;

struct val{
	ll l, r, v;	
	inline bool friend operator < (const val &x, const val &y){return x.l<y.l;}
}seg[MAXN];

inline void query(ll k, ll a, ll b, int i){
	if(a>b) swap(a,b);
	int o=upper_bound(w+1,w+1+(n+1),k)-w-1;
	if(a+b>pre[o]) return puts("No"), void();
	ll p=pre[o]; int l, r, mid;
	l=1, r=tot;
	while(l<=r){
		mid=(l+r)>>1;
		if(seg[mid].r<a) l=mid+1;
		else r=mid-1;
	}
	int id;
	if(l==tot+1) return puts("No"), void();
	else id=seg[l].v;
	p=min(p,pre[id]);
	if(b<=p-a) puts("Yes"), sum+=i;
	else puts("No");
	return ; 
}	

inline void prework(){
	ll L=-1, R=-1;
	for(int i=1;i<=n;++i){
		if(L==-1){
			L=max(pre[i-1]-w[i]+2,0ll), R=w[i]-1;
			if(L>R) L=R=-1;
			else seg[++tot]=val{L,R,i-1};
		}
		else{
			R=L-1, L=max(pre[i-1]-w[i]+2,0ll);
			if(L>R) L=R+1;
			else seg[++tot]=val{L,R,i-1}; 
		}
	}
	if(L==-1) seg[++tot]=val{0,pre[n],n};
	else if(L) seg[++tot]=val{0,L-1,n};	
	return ;
}

signed main(){
	n=read(), q=read();
	for(int i=1;i<=n;++i) w[i]=read();	
	sort(w+1,w+1+n); w[n+1]=2e18;
	for(int i=1;i<=n;++i) pre[i]=pre[i-1]+w[i];
	prework(); sort(seg+1,seg+1+tot);
	z=read(); ll k, a, b, j, c, d;
	for(int i=1;i<=q;++i){
		j=read(), c=read(), d=read();
		k=j-sum*z; a=c-sum*z; b=d-sum*z;
		query(k,a,b,i);
	}
	return 0;
}