#include<bits/stdc++.h>
#define int long long
//#define int __int128
#define ll long long
#define pa pair<int,int>
//#define int unsigned long long
#define sg signed
#define fi first
#define se second
#define ls s[x][0]
#define rs s[x][1]
#define ld long double
#define bs basic_string
const int inf=1e18;
using namespace std;
inline int read(){
    int s=0,w=1;
    char ch=getchar();
    while(ch<'0'||ch>'9') {
        if(ch=='-')w=-1;
        ch=getchar();
    }
    while(ch<='9'&&ch>='0')
        s=s*10+ch-'0',ch=getchar();
    return s*w;
}
int n,q,a1[300005];
int l[300005],w[300005],lst,lst1;
void solve(){
	n=read(),q=read();
	for(int i=1;i<=n;i++)a1[i]=read();
	sort(a1+1,a1+1+n);
	for(int i=1;i<=n;i++){
		if((w[i-1]/2+1)>=a1[i]&&l[i-1]==0){
			w[i]=w[i-1]+a1[i];
			lst=i;
		}else if(l[i-1]+w[i-1]+1>=a1[i]){
			w[i]=min(w[i-1],l[i-1]+w[i-1]+1-a1[i]);
			l[i]=l[i-1]+w[i-1]+a1[i]-w[i];
		}else{
			lst1=i-1;
			break;
		}
	}
//	cout<<lst<<" "<<lst1<<endl;
//	for(int i=1;i<=n;i++)cout<<a1[i]<<" ";
//	cout<<endl;
//	for(int i=1;i<=n;i++)cout<<l[i]<<' '<<w[i]<<endl;
	int z=read();
	int v=0;
	for(int i=1;i<=q;i++){
		int k=read(),a=read(),b=read();
		k-=v*z;a-=v*z;b-=v*z;
		if(a>b)swap(a,b);
		int pos=upper_bound(a1+1,a1+1+n,k)-a1-1;
		pos=min(pos,lst1);
		if(pos<=lst){
			if(a+b<=w[pos]){
				printf("Yes\n");
				v+=i;
				continue;
			}
			printf("No\n");
			continue;
		}
		int ans=lst;
		for(int j=(1<<20);j;j>>=1)
			if(ans+j<=pos&&w[ans+j]>=a)ans+=j;
//		cout<<"Wtf "<<ans<<endl;
		if(ans!=lst&&a+b<=l[ans]+w[ans]){
			printf("Yes\n");
			v+=i;
			continue;
		}
		printf("No\n");
	}
}
signed main(){
	int t=1;while(t--)solve();
    return 0;
}
/*
10 2
29 1 11 5 2 48 1 3 3 34
0
1 1 1
7 2 4
*/